./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.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.03.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 53b2835bffc5e46db9e843d7a27e5dc2af58bf47930b3bc6dacf70c618d5bd01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:06:28,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:06:28,474 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:06:28,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:06:28,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:06:28,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:06:28,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:06:28,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:06:28,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:06:28,503 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:06:28,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:06:28,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:06:28,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:06:28,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:06:28,504 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:06:28,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:06:28,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:06:28,504 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:06:28,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:06:28,504 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:06:28,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:06:28,504 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:06:28,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:06:28,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:06:28,504 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:06:28,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:06:28,505 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:06:28,505 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:06:28,505 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:06:28,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:06:28,505 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:06:28,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:06:28,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:28,505 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:06:28,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:06:28,505 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:06:28,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:06:28,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:28,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:06:28,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:06:28,506 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:06:28,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:06:28,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:06:28,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:06:28,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:06:28,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:06:28,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:06:28,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:06:28,506 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 -> 53b2835bffc5e46db9e843d7a27e5dc2af58bf47930b3bc6dacf70c618d5bd01 [2025-01-09 06:06:28,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:06:28,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:06:28,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:06:28,819 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:06:28,820 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:06:28,823 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.03.cil-2.c [2025-01-09 06:06:30,239 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36b6af434/041e9ef506a343999eb15fe3697ccc42/FLAG91faabdbc [2025-01-09 06:06:30,536 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:06:30,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c [2025-01-09 06:06:30,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36b6af434/041e9ef506a343999eb15fe3697ccc42/FLAG91faabdbc [2025-01-09 06:06:30,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36b6af434/041e9ef506a343999eb15fe3697ccc42 [2025-01-09 06:06:30,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:06:30,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:06:30,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:06:30,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:06:30,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:06:30,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:06:30" (1/1) ... [2025-01-09 06:06:30,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27194523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:30, skipping insertion in model container [2025-01-09 06:06:30,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:06:30" (1/1) ... [2025-01-09 06:06:30,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:06:30,762 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.03.cil-2.c[911,924] [2025-01-09 06:06:30,838 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.03.cil-2.c[8416,8429] [2025-01-09 06:06:30,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:06:30,923 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:06:30,935 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.03.cil-2.c[911,924] [2025-01-09 06:06:30,971 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.03.cil-2.c[8416,8429] [2025-01-09 06:06:30,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:06:31,027 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:06:31,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:31 WrapperNode [2025-01-09 06:06:31,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:06:31,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:06:31,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:06:31,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:06:31,038 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:06:31" (1/1) ... [2025-01-09 06:06:31,054 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:06:31" (1/1) ... [2025-01-09 06:06:31,095 INFO L138 Inliner]: procedures = 61, calls = 70, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 536 [2025-01-09 06:06:31,096 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:06:31,097 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:06:31,097 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:06:31,097 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:06:31,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:31" (1/1) ... [2025-01-09 06:06:31,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:31" (1/1) ... [2025-01-09 06:06:31,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:31" (1/1) ... [2025-01-09 06:06:31,140 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:06:31,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:31" (1/1) ... [2025-01-09 06:06:31,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:31" (1/1) ... [2025-01-09 06:06:31,152 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:31" (1/1) ... [2025-01-09 06:06:31,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:31" (1/1) ... [2025-01-09 06:06:31,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:31" (1/1) ... [2025-01-09 06:06:31,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:31" (1/1) ... [2025-01-09 06:06:31,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:31" (1/1) ... [2025-01-09 06:06:31,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:06:31,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:06:31,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:06:31,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:06:31,186 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:31" (1/1) ... [2025-01-09 06:06:31,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:31,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:06:31,228 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:06:31,233 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:06:31,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:06:31,251 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:06:31,251 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:06:31,251 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 06:06:31,251 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 06:06:31,251 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:06:31,251 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:06:31,251 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:06:31,251 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:06:31,251 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-01-09 06:06:31,251 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-01-09 06:06:31,251 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:06:31,252 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:06:31,252 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:06:31,252 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:06:31,252 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-01-09 06:06:31,252 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-01-09 06:06:31,252 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 06:06:31,252 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 06:06:31,252 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-01-09 06:06:31,252 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-01-09 06:06:31,252 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:06:31,252 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:06:31,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:06:31,252 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:06:31,252 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:06:31,252 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-01-09 06:06:31,253 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-01-09 06:06:31,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:06:31,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:06:31,253 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:06:31,253 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:06:31,356 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:06:31,358 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:06:31,857 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##48: assume !(1 == ~q_free~0); [2025-01-09 06:06:31,858 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:06:31,967 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2025-01-09 06:06:31,967 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:06:31,990 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:06:31,993 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-01-09 06:06:31,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:06:31 BoogieIcfgContainer [2025-01-09 06:06:31,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:06:31,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:06:31,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:06:32,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:06:32,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:06:30" (1/3) ... [2025-01-09 06:06:32,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1518017b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:06:32, skipping insertion in model container [2025-01-09 06:06:32,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:31" (2/3) ... [2025-01-09 06:06:32,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1518017b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:06:32, skipping insertion in model container [2025-01-09 06:06:32,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:06:31" (3/3) ... [2025-01-09 06:06:32,003 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.03.cil-2.c [2025-01-09 06:06:32,013 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:06:32,015 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.03.cil-2.c that has 15 procedures, 268 locations, 1 initial locations, 10 loop locations, and 2 error locations. [2025-01-09 06:06:32,070 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:06:32,082 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;@298385f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:06:32,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:06:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 268 states, 220 states have (on average 1.5272727272727273) internal successors, (336), 224 states have internal predecessors, (336), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 06:06:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:06:32,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:32,097 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:06:32,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:32,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:32,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1298445460, now seen corresponding path program 1 times [2025-01-09 06:06:32,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:32,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979986259] [2025-01-09 06:06:32,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:32,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:32,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:06:32,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:06:32,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:32,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:32,559 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:06:32,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:32,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979986259] [2025-01-09 06:06:32,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979986259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:32,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:32,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:32,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314019099] [2025-01-09 06:06:32,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:32,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:32,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:32,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:32,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:32,594 INFO L87 Difference]: Start difference. First operand has 268 states, 220 states have (on average 1.5272727272727273) internal successors, (336), 224 states have internal predecessors, (336), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) 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:06:33,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:33,288 INFO L93 Difference]: Finished difference Result 632 states and 953 transitions. [2025-01-09 06:06:33,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:33,291 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:06:33,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:33,306 INFO L225 Difference]: With dead ends: 632 [2025-01-09 06:06:33,306 INFO L226 Difference]: Without dead ends: 373 [2025-01-09 06:06:33,313 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:06:33,320 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 336 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:33,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 939 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:06:33,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-09 06:06:33,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 366. [2025-01-09 06:06:33,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 296 states have (on average 1.4763513513513513) internal successors, (437), 302 states have internal predecessors, (437), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2025-01-09 06:06:33,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 532 transitions. [2025-01-09 06:06:33,415 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 532 transitions. Word has length 63 [2025-01-09 06:06:33,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:33,416 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 532 transitions. [2025-01-09 06:06:33,416 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:06:33,417 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 532 transitions. [2025-01-09 06:06:33,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:06:33,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:33,421 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:06:33,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:06:33,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:33,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:33,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1779525718, now seen corresponding path program 1 times [2025-01-09 06:06:33,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:33,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562533135] [2025-01-09 06:06:33,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:33,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:33,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:06:33,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:06:33,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:33,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:33,649 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:06:33,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:33,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562533135] [2025-01-09 06:06:33,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562533135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:33,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:33,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:33,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867061120] [2025-01-09 06:06:33,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:33,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:33,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:33,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:33,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:33,652 INFO L87 Difference]: Start difference. First operand 366 states and 532 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:06:34,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:34,403 INFO L93 Difference]: Finished difference Result 721 states and 1035 transitions. [2025-01-09 06:06:34,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:34,404 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:06:34,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:34,410 INFO L225 Difference]: With dead ends: 721 [2025-01-09 06:06:34,410 INFO L226 Difference]: Without dead ends: 520 [2025-01-09 06:06:34,411 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:06:34,412 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 546 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:34,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1126 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:06:34,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-01-09 06:06:34,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 474. [2025-01-09 06:06:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 382 states have (on average 1.463350785340314) internal successors, (559), 390 states have internal predecessors, (559), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2025-01-09 06:06:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 688 transitions. [2025-01-09 06:06:34,465 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 688 transitions. Word has length 63 [2025-01-09 06:06:34,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:34,465 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 688 transitions. [2025-01-09 06:06:34,466 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:06:34,467 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 688 transitions. [2025-01-09 06:06:34,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:06:34,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:34,473 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:06:34,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:06:34,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:34,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:34,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1795044436, now seen corresponding path program 1 times [2025-01-09 06:06:34,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:34,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254405295] [2025-01-09 06:06:34,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:34,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:34,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:06:34,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:06:34,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:34,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:34,548 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:06:34,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:34,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254405295] [2025-01-09 06:06:34,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254405295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:34,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:34,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:34,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5942092] [2025-01-09 06:06:34,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:34,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:34,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:34,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:34,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:34,551 INFO L87 Difference]: Start difference. First operand 474 states and 688 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:06:34,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:34,773 INFO L93 Difference]: Finished difference Result 1344 states and 1934 transitions. [2025-01-09 06:06:34,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:34,774 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:06:34,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:34,781 INFO L225 Difference]: With dead ends: 1344 [2025-01-09 06:06:34,781 INFO L226 Difference]: Without dead ends: 1041 [2025-01-09 06:06:34,782 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:06:34,783 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 471 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:34,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 921 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:06:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2025-01-09 06:06:34,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1024. [2025-01-09 06:06:34,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 822 states have (on average 1.4197080291970803) internal successors, (1167), 838 states have internal predecessors, (1167), 119 states have call successors, (119), 70 states have call predecessors, (119), 81 states have return successors, (155), 119 states have call predecessors, (155), 117 states have call successors, (155) [2025-01-09 06:06:34,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1441 transitions. [2025-01-09 06:06:34,903 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1441 transitions. Word has length 63 [2025-01-09 06:06:34,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:34,904 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1441 transitions. [2025-01-09 06:06:34,904 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:06:34,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1441 transitions. [2025-01-09 06:06:34,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:06:34,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:34,907 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:06:34,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:06:34,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:34,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:34,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1353649743, now seen corresponding path program 1 times [2025-01-09 06:06:34,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:34,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802384992] [2025-01-09 06:06:34,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:34,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:34,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:06:34,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:06:34,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:34,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:34,989 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:06:34,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:34,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802384992] [2025-01-09 06:06:34,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802384992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:34,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:34,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:34,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658074561] [2025-01-09 06:06:34,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:34,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:34,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:34,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:34,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:34,991 INFO L87 Difference]: Start difference. First operand 1024 states and 1441 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:06:35,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:35,073 INFO L93 Difference]: Finished difference Result 1897 states and 2675 transitions. [2025-01-09 06:06:35,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:35,074 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:06:35,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:35,081 INFO L225 Difference]: With dead ends: 1897 [2025-01-09 06:06:35,082 INFO L226 Difference]: Without dead ends: 1044 [2025-01-09 06:06:35,084 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:06:35,085 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 0 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1869 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:06:35,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1869 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:35,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2025-01-09 06:06:35,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1044. [2025-01-09 06:06:35,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 838 states have (on average 1.405727923627685) internal successors, (1178), 854 states have internal predecessors, (1178), 119 states have call successors, (119), 70 states have call predecessors, (119), 85 states have return successors, (162), 123 states have call predecessors, (162), 117 states have call successors, (162) [2025-01-09 06:06:35,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1459 transitions. [2025-01-09 06:06:35,179 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1459 transitions. Word has length 64 [2025-01-09 06:06:35,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:35,181 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1459 transitions. [2025-01-09 06:06:35,182 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:06:35,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1459 transitions. [2025-01-09 06:06:35,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:06:35,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:35,184 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:06:35,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:06:35,185 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:35,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:35,185 INFO L85 PathProgramCache]: Analyzing trace with hash 959282957, now seen corresponding path program 1 times [2025-01-09 06:06:35,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:35,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136034615] [2025-01-09 06:06:35,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:35,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:35,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:06:35,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:06:35,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:35,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:35,265 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:06:35,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:35,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136034615] [2025-01-09 06:06:35,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136034615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:35,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:35,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:35,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973252656] [2025-01-09 06:06:35,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:35,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:35,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:35,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:35,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:35,270 INFO L87 Difference]: Start difference. First operand 1044 states and 1459 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:06:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:35,950 INFO L93 Difference]: Finished difference Result 3506 states and 4896 transitions. [2025-01-09 06:06:35,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:06:35,951 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:06:35,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:35,963 INFO L225 Difference]: With dead ends: 3506 [2025-01-09 06:06:35,964 INFO L226 Difference]: Without dead ends: 1334 [2025-01-09 06:06:35,970 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:06:35,972 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 1263 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:35,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 1764 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:35,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2025-01-09 06:06:36,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 969. [2025-01-09 06:06:36,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 763 states have (on average 1.3682830930537353) internal successors, (1044), 779 states have internal predecessors, (1044), 119 states have call successors, (119), 70 states have call predecessors, (119), 85 states have return successors, (150), 123 states have call predecessors, (150), 117 states have call successors, (150) [2025-01-09 06:06:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1313 transitions. [2025-01-09 06:06:36,084 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1313 transitions. Word has length 64 [2025-01-09 06:06:36,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:36,085 INFO L471 AbstractCegarLoop]: Abstraction has 969 states and 1313 transitions. [2025-01-09 06:06:36,085 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:06:36,085 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1313 transitions. [2025-01-09 06:06:36,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:06:36,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:36,087 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:06:36,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:06:36,087 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:36,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:36,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1024616075, now seen corresponding path program 1 times [2025-01-09 06:06:36,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:36,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002470515] [2025-01-09 06:06:36,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:36,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:36,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:06:36,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:06:36,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:36,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:36,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:36,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002470515] [2025-01-09 06:06:36,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002470515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:36,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:36,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:06:36,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331066213] [2025-01-09 06:06:36,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:36,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:06:36,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:36,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:06:36,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:06:36,240 INFO L87 Difference]: Start difference. First operand 969 states and 1313 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:06:36,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:36,952 INFO L93 Difference]: Finished difference Result 2048 states and 2759 transitions. [2025-01-09 06:06:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:06:36,952 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2025-01-09 06:06:36,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:36,955 INFO L225 Difference]: With dead ends: 2048 [2025-01-09 06:06:36,956 INFO L226 Difference]: Without dead ends: 151 [2025-01-09 06:06:36,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-09 06:06:36,962 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 682 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:36,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 988 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:06:36,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-09 06:06:36,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-01-09 06:06:36,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 127 states have (on average 1.5039370078740157) internal successors, (191), 128 states have internal predecessors, (191), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 06:06:36,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 225 transitions. [2025-01-09 06:06:36,977 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 225 transitions. Word has length 65 [2025-01-09 06:06:36,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:36,977 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 225 transitions. [2025-01-09 06:06:36,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:06:36,977 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 225 transitions. [2025-01-09 06:06:36,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:36,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:36,978 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] [2025-01-09 06:06:36,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:06:36,979 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:36,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:36,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1928030313, now seen corresponding path program 1 times [2025-01-09 06:06:36,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:36,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825676384] [2025-01-09 06:06:36,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:36,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:36,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:37,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:37,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:37,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:37,109 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:06:37,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:37,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825676384] [2025-01-09 06:06:37,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825676384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:37,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:37,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:37,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957310674] [2025-01-09 06:06:37,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:37,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:37,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:37,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:37,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:37,112 INFO L87 Difference]: Start difference. First operand 151 states and 225 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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:06:37,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:37,385 INFO L93 Difference]: Finished difference Result 441 states and 665 transitions. [2025-01-09 06:06:37,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:37,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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 77 [2025-01-09 06:06:37,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:37,389 INFO L225 Difference]: With dead ends: 441 [2025-01-09 06:06:37,389 INFO L226 Difference]: Without dead ends: 302 [2025-01-09 06:06:37,393 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:06:37,394 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 385 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:37,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 593 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:37,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-01-09 06:06:37,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 291. [2025-01-09 06:06:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 248 states have (on average 1.5161290322580645) internal successors, (376), 250 states have internal predecessors, (376), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-01-09 06:06:37,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 435 transitions. [2025-01-09 06:06:37,413 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 435 transitions. Word has length 77 [2025-01-09 06:06:37,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:37,414 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 435 transitions. [2025-01-09 06:06:37,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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:06:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2025-01-09 06:06:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:37,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:37,417 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] [2025-01-09 06:06:37,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:06:37,417 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:37,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:37,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2090088987, now seen corresponding path program 1 times [2025-01-09 06:06:37,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:37,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993870458] [2025-01-09 06:06:37,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:37,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:37,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:37,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:37,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:37,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:37,541 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:06:37,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:37,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993870458] [2025-01-09 06:06:37,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993870458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:37,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:37,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:37,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842776204] [2025-01-09 06:06:37,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:37,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:37,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:37,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:37,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:37,543 INFO L87 Difference]: Start difference. First operand 291 states and 435 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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:06:37,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:37,971 INFO L93 Difference]: Finished difference Result 744 states and 1122 transitions. [2025-01-09 06:06:37,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:37,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 77 [2025-01-09 06:06:37,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:37,976 INFO L225 Difference]: With dead ends: 744 [2025-01-09 06:06:37,976 INFO L226 Difference]: Without dead ends: 465 [2025-01-09 06:06:37,977 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:06:37,977 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 377 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:37,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1097 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-01-09 06:06:37,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 422. [2025-01-09 06:06:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 360 states have (on average 1.5083333333333333) internal successors, (543), 363 states have internal predecessors, (543), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (45), 42 states have call predecessors, (45), 41 states have call successors, (45) [2025-01-09 06:06:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 629 transitions. [2025-01-09 06:06:38,004 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 629 transitions. Word has length 77 [2025-01-09 06:06:38,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:38,004 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 629 transitions. [2025-01-09 06:06:38,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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:06:38,005 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 629 transitions. [2025-01-09 06:06:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:38,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:38,007 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] [2025-01-09 06:06:38,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:06:38,009 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:38,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:38,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1525606055, now seen corresponding path program 1 times [2025-01-09 06:06:38,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:38,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772300777] [2025-01-09 06:06:38,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:38,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:38,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:38,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:38,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:38,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:38,113 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:06:38,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:38,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772300777] [2025-01-09 06:06:38,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772300777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:38,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:38,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:38,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034584457] [2025-01-09 06:06:38,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:38,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:38,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:38,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:38,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:38,115 INFO L87 Difference]: Start difference. First operand 422 states and 629 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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:06:38,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:38,504 INFO L93 Difference]: Finished difference Result 1153 states and 1735 transitions. [2025-01-09 06:06:38,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:38,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 77 [2025-01-09 06:06:38,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:38,509 INFO L225 Difference]: With dead ends: 1153 [2025-01-09 06:06:38,510 INFO L226 Difference]: Without dead ends: 743 [2025-01-09 06:06:38,511 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:06:38,512 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 372 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:38,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1081 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:38,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-01-09 06:06:38,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 697. [2025-01-09 06:06:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 595 states have (on average 1.5058823529411764) internal successors, (896), 602 states have internal predecessors, (896), 65 states have call successors, (65), 30 states have call predecessors, (65), 36 states have return successors, (81), 68 states have call predecessors, (81), 65 states have call successors, (81) [2025-01-09 06:06:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1042 transitions. [2025-01-09 06:06:38,554 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1042 transitions. Word has length 77 [2025-01-09 06:06:38,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:38,554 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 1042 transitions. [2025-01-09 06:06:38,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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:06:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1042 transitions. [2025-01-09 06:06:38,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:38,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:38,558 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] [2025-01-09 06:06:38,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:06:38,559 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:38,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:38,559 INFO L85 PathProgramCache]: Analyzing trace with hash 435968603, now seen corresponding path program 1 times [2025-01-09 06:06:38,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:38,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995027002] [2025-01-09 06:06:38,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:38,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:38,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:38,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:38,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:38,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:38,680 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:06:38,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:38,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995027002] [2025-01-09 06:06:38,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995027002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:38,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:38,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:38,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604801973] [2025-01-09 06:06:38,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:38,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:38,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:38,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:38,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:38,682 INFO L87 Difference]: Start difference. First operand 697 states and 1042 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:06:38,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:38,908 INFO L93 Difference]: Finished difference Result 1448 states and 2193 transitions. [2025-01-09 06:06:38,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:38,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 77 [2025-01-09 06:06:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:38,914 INFO L225 Difference]: With dead ends: 1448 [2025-01-09 06:06:38,914 INFO L226 Difference]: Without dead ends: 763 [2025-01-09 06:06:38,917 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:06:38,918 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 279 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:38,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 409 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:38,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-01-09 06:06:38,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 697. [2025-01-09 06:06:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 595 states have (on average 1.4974789915966387) internal successors, (891), 602 states have internal predecessors, (891), 65 states have call successors, (65), 30 states have call predecessors, (65), 36 states have return successors, (81), 68 states have call predecessors, (81), 65 states have call successors, (81) [2025-01-09 06:06:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1037 transitions. [2025-01-09 06:06:38,967 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1037 transitions. Word has length 77 [2025-01-09 06:06:38,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:38,968 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 1037 transitions. [2025-01-09 06:06:38,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:06:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1037 transitions. [2025-01-09 06:06:38,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:38,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:38,970 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] [2025-01-09 06:06:38,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:06:38,970 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:38,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:38,971 INFO L85 PathProgramCache]: Analyzing trace with hash 637792537, now seen corresponding path program 1 times [2025-01-09 06:06:38,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:38,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028956504] [2025-01-09 06:06:38,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:38,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:38,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:38,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:38,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:38,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:39,055 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:06:39,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:39,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028956504] [2025-01-09 06:06:39,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028956504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:39,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:39,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:39,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839912324] [2025-01-09 06:06:39,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:39,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:39,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:39,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:39,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:39,058 INFO L87 Difference]: Start difference. First operand 697 states and 1037 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:06:39,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:39,283 INFO L93 Difference]: Finished difference Result 1437 states and 2161 transitions. [2025-01-09 06:06:39,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:39,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 77 [2025-01-09 06:06:39,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:39,290 INFO L225 Difference]: With dead ends: 1437 [2025-01-09 06:06:39,290 INFO L226 Difference]: Without dead ends: 752 [2025-01-09 06:06:39,293 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:06:39,294 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 274 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:39,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 399 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-01-09 06:06:39,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 697. [2025-01-09 06:06:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 595 states have (on average 1.4890756302521009) internal successors, (886), 602 states have internal predecessors, (886), 65 states have call successors, (65), 30 states have call predecessors, (65), 36 states have return successors, (81), 68 states have call predecessors, (81), 65 states have call successors, (81) [2025-01-09 06:06:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1032 transitions. [2025-01-09 06:06:39,343 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1032 transitions. Word has length 77 [2025-01-09 06:06:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:39,343 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 1032 transitions. [2025-01-09 06:06:39,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:06:39,344 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1032 transitions. [2025-01-09 06:06:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:39,345 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:39,345 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] [2025-01-09 06:06:39,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:06:39,345 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:39,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:39,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1198492315, now seen corresponding path program 1 times [2025-01-09 06:06:39,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:39,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542167873] [2025-01-09 06:06:39,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:39,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:39,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:39,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:39,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:39,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:39,447 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:06:39,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:39,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542167873] [2025-01-09 06:06:39,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542167873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:39,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:39,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:39,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287276398] [2025-01-09 06:06:39,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:39,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:39,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:39,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:39,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:39,450 INFO L87 Difference]: Start difference. First operand 697 states and 1032 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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:06:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:39,930 INFO L93 Difference]: Finished difference Result 2058 states and 3073 transitions. [2025-01-09 06:06:39,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:39,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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 77 [2025-01-09 06:06:39,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:39,940 INFO L225 Difference]: With dead ends: 2058 [2025-01-09 06:06:39,941 INFO L226 Difference]: Without dead ends: 1373 [2025-01-09 06:06:39,943 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:06:39,943 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 424 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:39,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1014 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2025-01-09 06:06:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1234. [2025-01-09 06:06:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1050 states have (on average 1.483809523809524) internal successors, (1558), 1071 states have internal predecessors, (1558), 109 states have call successors, (109), 54 states have call predecessors, (109), 74 states have return successors, (173), 116 states have call predecessors, (173), 109 states have call successors, (173) [2025-01-09 06:06:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1840 transitions. [2025-01-09 06:06:40,046 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1840 transitions. Word has length 77 [2025-01-09 06:06:40,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:40,047 INFO L471 AbstractCegarLoop]: Abstraction has 1234 states and 1840 transitions. [2025-01-09 06:06:40,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 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:06:40,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1840 transitions. [2025-01-09 06:06:40,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:40,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:40,049 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] [2025-01-09 06:06:40,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:06:40,050 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:40,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:40,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1632221401, now seen corresponding path program 1 times [2025-01-09 06:06:40,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:40,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070769453] [2025-01-09 06:06:40,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:40,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:40,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:40,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:40,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:40,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:40,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:40,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070769453] [2025-01-09 06:06:40,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070769453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:40,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:40,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:40,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75831239] [2025-01-09 06:06:40,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:40,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:40,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:40,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:40,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:40,144 INFO L87 Difference]: Start difference. First operand 1234 states and 1840 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:06:40,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:40,456 INFO L93 Difference]: Finished difference Result 2514 states and 3775 transitions. [2025-01-09 06:06:40,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:40,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 77 [2025-01-09 06:06:40,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:40,465 INFO L225 Difference]: With dead ends: 2514 [2025-01-09 06:06:40,466 INFO L226 Difference]: Without dead ends: 1292 [2025-01-09 06:06:40,470 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:06:40,471 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 269 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:40,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 379 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2025-01-09 06:06:40,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1234. [2025-01-09 06:06:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1050 states have (on average 1.4752380952380952) internal successors, (1549), 1071 states have internal predecessors, (1549), 109 states have call successors, (109), 54 states have call predecessors, (109), 74 states have return successors, (173), 116 states have call predecessors, (173), 109 states have call successors, (173) [2025-01-09 06:06:40,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1831 transitions. [2025-01-09 06:06:40,568 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1831 transitions. Word has length 77 [2025-01-09 06:06:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:40,568 INFO L471 AbstractCegarLoop]: Abstraction has 1234 states and 1831 transitions. [2025-01-09 06:06:40,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:06:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1831 transitions. [2025-01-09 06:06:40,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:40,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:40,572 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] [2025-01-09 06:06:40,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:06:40,573 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:40,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:40,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1672896151, now seen corresponding path program 1 times [2025-01-09 06:06:40,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:40,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210504272] [2025-01-09 06:06:40,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:40,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:40,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:40,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:40,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:40,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:40,650 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:06:40,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:40,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210504272] [2025-01-09 06:06:40,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210504272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:40,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:40,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:40,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307238383] [2025-01-09 06:06:40,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:40,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:40,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:40,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:40,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:40,652 INFO L87 Difference]: Start difference. First operand 1234 states and 1831 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 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:06:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:40,737 INFO L93 Difference]: Finished difference Result 2482 states and 3730 transitions. [2025-01-09 06:06:40,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:40,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 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 77 [2025-01-09 06:06:40,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:40,747 INFO L225 Difference]: With dead ends: 2482 [2025-01-09 06:06:40,747 INFO L226 Difference]: Without dead ends: 1261 [2025-01-09 06:06:40,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:40,752 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:40,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 870 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:40,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2025-01-09 06:06:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1261. [2025-01-09 06:06:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1077 states have (on average 1.4633240482822656) internal successors, (1576), 1098 states have internal predecessors, (1576), 109 states have call successors, (109), 54 states have call predecessors, (109), 74 states have return successors, (173), 116 states have call predecessors, (173), 109 states have call successors, (173) [2025-01-09 06:06:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1858 transitions. [2025-01-09 06:06:40,856 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1858 transitions. Word has length 77 [2025-01-09 06:06:40,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:40,856 INFO L471 AbstractCegarLoop]: Abstraction has 1261 states and 1858 transitions. [2025-01-09 06:06:40,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 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:06:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1858 transitions. [2025-01-09 06:06:40,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:40,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:40,859 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] [2025-01-09 06:06:40,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:06:40,860 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:40,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:40,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1319807769, now seen corresponding path program 1 times [2025-01-09 06:06:40,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:40,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416710813] [2025-01-09 06:06:40,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:40,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:40,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:40,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:40,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:40,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:40,911 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:06:40,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:40,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416710813] [2025-01-09 06:06:40,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416710813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:40,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:40,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:40,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687406550] [2025-01-09 06:06:40,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:40,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:40,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:40,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:40,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:40,913 INFO L87 Difference]: Start difference. First operand 1261 states and 1858 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 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:06:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:41,158 INFO L93 Difference]: Finished difference Result 3711 states and 5505 transitions. [2025-01-09 06:06:41,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:41,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 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 77 [2025-01-09 06:06:41,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:41,175 INFO L225 Difference]: With dead ends: 3711 [2025-01-09 06:06:41,175 INFO L226 Difference]: Without dead ends: 2463 [2025-01-09 06:06:41,182 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:06:41,182 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 380 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:41,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 745 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:06:41,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2025-01-09 06:06:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2452. [2025-01-09 06:06:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 2098 states have (on average 1.4566253574833175) internal successors, (3056), 2139 states have internal predecessors, (3056), 205 states have call successors, (205), 108 states have call predecessors, (205), 148 states have return successors, (326), 212 states have call predecessors, (326), 205 states have call successors, (326) [2025-01-09 06:06:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3587 transitions. [2025-01-09 06:06:41,389 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3587 transitions. Word has length 77 [2025-01-09 06:06:41,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:41,389 INFO L471 AbstractCegarLoop]: Abstraction has 2452 states and 3587 transitions. [2025-01-09 06:06:41,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 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:06:41,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3587 transitions. [2025-01-09 06:06:41,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:41,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:41,392 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] [2025-01-09 06:06:41,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:06:41,392 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:41,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:41,393 INFO L85 PathProgramCache]: Analyzing trace with hash 446330074, now seen corresponding path program 1 times [2025-01-09 06:06:41,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:41,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694748202] [2025-01-09 06:06:41,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:41,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:41,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:41,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:41,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:41,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:41,455 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:06:41,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:41,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694748202] [2025-01-09 06:06:41,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694748202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:41,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:41,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:41,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436260316] [2025-01-09 06:06:41,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:41,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:41,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:41,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:41,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:41,459 INFO L87 Difference]: Start difference. First operand 2452 states and 3587 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 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:06:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:41,684 INFO L93 Difference]: Finished difference Result 4918 states and 7284 transitions. [2025-01-09 06:06:41,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:41,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 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 77 [2025-01-09 06:06:41,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:41,700 INFO L225 Difference]: With dead ends: 4918 [2025-01-09 06:06:41,701 INFO L226 Difference]: Without dead ends: 2479 [2025-01-09 06:06:41,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:41,710 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:41,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 870 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:41,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2025-01-09 06:06:41,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2479. [2025-01-09 06:06:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2479 states, 2125 states have (on average 1.4465882352941177) internal successors, (3074), 2166 states have internal predecessors, (3074), 205 states have call successors, (205), 108 states have call predecessors, (205), 148 states have return successors, (326), 212 states have call predecessors, (326), 205 states have call successors, (326) [2025-01-09 06:06:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3605 transitions. [2025-01-09 06:06:41,925 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3605 transitions. Word has length 77 [2025-01-09 06:06:41,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:41,926 INFO L471 AbstractCegarLoop]: Abstraction has 2479 states and 3605 transitions. [2025-01-09 06:06:41,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 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:06:41,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3605 transitions. [2025-01-09 06:06:41,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:41,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:41,929 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] [2025-01-09 06:06:41,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:06:41,929 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:41,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:41,930 INFO L85 PathProgramCache]: Analyzing trace with hash 869976796, now seen corresponding path program 1 times [2025-01-09 06:06:41,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:41,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254332914] [2025-01-09 06:06:41,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:41,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:41,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:41,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:41,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:41,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:41,989 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:06:41,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:41,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254332914] [2025-01-09 06:06:41,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254332914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:41,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:41,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:41,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349109111] [2025-01-09 06:06:41,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:41,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:41,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:41,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:41,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:41,992 INFO L87 Difference]: Start difference. First operand 2479 states and 3605 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 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:06:42,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:42,123 INFO L93 Difference]: Finished difference Result 4999 states and 7356 transitions. [2025-01-09 06:06:42,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:42,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 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 77 [2025-01-09 06:06:42,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:42,139 INFO L225 Difference]: With dead ends: 4999 [2025-01-09 06:06:42,140 INFO L226 Difference]: Without dead ends: 2533 [2025-01-09 06:06:42,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:42,148 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:42,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 870 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:42,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2533 states. [2025-01-09 06:06:42,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2533 to 2533. [2025-01-09 06:06:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2533 states, 2179 states have (on average 1.4355208811381368) internal successors, (3128), 2220 states have internal predecessors, (3128), 205 states have call successors, (205), 108 states have call predecessors, (205), 148 states have return successors, (326), 212 states have call predecessors, (326), 205 states have call successors, (326) [2025-01-09 06:06:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2533 states and 3659 transitions. [2025-01-09 06:06:42,360 INFO L78 Accepts]: Start accepts. Automaton has 2533 states and 3659 transitions. Word has length 77 [2025-01-09 06:06:42,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:42,360 INFO L471 AbstractCegarLoop]: Abstraction has 2533 states and 3659 transitions. [2025-01-09 06:06:42,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 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:06:42,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 3659 transitions. [2025-01-09 06:06:42,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:42,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:42,362 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] [2025-01-09 06:06:42,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:06:42,363 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:42,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:42,364 INFO L85 PathProgramCache]: Analyzing trace with hash 25971294, now seen corresponding path program 1 times [2025-01-09 06:06:42,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:42,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311968903] [2025-01-09 06:06:42,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:42,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:42,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:42,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:42,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:42,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:42,418 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:06:42,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:42,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311968903] [2025-01-09 06:06:42,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311968903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:42,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:42,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:42,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180741557] [2025-01-09 06:06:42,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:42,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:42,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:42,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:42,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:42,422 INFO L87 Difference]: Start difference. First operand 2533 states and 3659 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 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:06:42,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:42,816 INFO L93 Difference]: Finished difference Result 7482 states and 10878 transitions. [2025-01-09 06:06:42,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:42,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 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 77 [2025-01-09 06:06:42,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:42,844 INFO L225 Difference]: With dead ends: 7482 [2025-01-09 06:06:42,844 INFO L226 Difference]: Without dead ends: 4962 [2025-01-09 06:06:42,851 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:06:42,852 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 392 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:42,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 745 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:06:42,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4962 states. [2025-01-09 06:06:43,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4962 to 4942. [2025-01-09 06:06:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4942 states, 4257 states have (on average 1.4280009396288467) internal successors, (6079), 4338 states have internal predecessors, (6079), 388 states have call successors, (388), 216 states have call predecessors, (388), 296 states have return successors, (623), 395 states have call predecessors, (623), 388 states have call successors, (623) [2025-01-09 06:06:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4942 states to 4942 states and 7090 transitions. [2025-01-09 06:06:43,408 INFO L78 Accepts]: Start accepts. Automaton has 4942 states and 7090 transitions. Word has length 77 [2025-01-09 06:06:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:43,408 INFO L471 AbstractCegarLoop]: Abstraction has 4942 states and 7090 transitions. [2025-01-09 06:06:43,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 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:06:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 4942 states and 7090 transitions. [2025-01-09 06:06:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:43,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:43,410 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] [2025-01-09 06:06:43,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:06:43,411 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:43,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:43,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1550586465, now seen corresponding path program 1 times [2025-01-09 06:06:43,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:43,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904631854] [2025-01-09 06:06:43,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:43,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:43,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:43,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:43,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:43,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:43,479 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:06:43,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:43,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904631854] [2025-01-09 06:06:43,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904631854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:43,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:43,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:43,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758492695] [2025-01-09 06:06:43,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:43,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:43,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:43,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:43,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:43,482 INFO L87 Difference]: Start difference. First operand 4942 states and 7090 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 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:06:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:43,793 INFO L93 Difference]: Finished difference Result 9925 states and 14401 transitions. [2025-01-09 06:06:43,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:43,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 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 77 [2025-01-09 06:06:43,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:43,827 INFO L225 Difference]: With dead ends: 9925 [2025-01-09 06:06:43,828 INFO L226 Difference]: Without dead ends: 4996 [2025-01-09 06:06:43,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:43,844 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:43,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 870 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4996 states. [2025-01-09 06:06:44,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4996 to 4996. [2025-01-09 06:06:44,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4996 states, 4311 states have (on average 1.4184643934122014) internal successors, (6115), 4392 states have internal predecessors, (6115), 388 states have call successors, (388), 216 states have call predecessors, (388), 296 states have return successors, (623), 395 states have call predecessors, (623), 388 states have call successors, (623) [2025-01-09 06:06:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4996 states to 4996 states and 7126 transitions. [2025-01-09 06:06:44,238 INFO L78 Accepts]: Start accepts. Automaton has 4996 states and 7126 transitions. Word has length 77 [2025-01-09 06:06:44,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:44,238 INFO L471 AbstractCegarLoop]: Abstraction has 4996 states and 7126 transitions. [2025-01-09 06:06:44,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 1 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:06:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 4996 states and 7126 transitions. [2025-01-09 06:06:44,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:44,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:44,240 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] [2025-01-09 06:06:44,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:06:44,240 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:44,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:44,241 INFO L85 PathProgramCache]: Analyzing trace with hash -164383071, now seen corresponding path program 1 times [2025-01-09 06:06:44,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:44,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921635363] [2025-01-09 06:06:44,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:44,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:44,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:44,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:44,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:44,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:44,356 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:06:44,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:44,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921635363] [2025-01-09 06:06:44,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921635363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:44,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:44,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:44,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811314031] [2025-01-09 06:06:44,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:44,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:44,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:44,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:44,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:44,358 INFO L87 Difference]: Start difference. First operand 4996 states and 7126 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:44,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:44,864 INFO L93 Difference]: Finished difference Result 6408 states and 9172 transitions. [2025-01-09 06:06:44,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:44,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-01-09 06:06:44,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:44,889 INFO L225 Difference]: With dead ends: 6408 [2025-01-09 06:06:44,889 INFO L226 Difference]: Without dead ends: 3490 [2025-01-09 06:06:44,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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:06:44,900 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 359 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:44,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 741 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2025-01-09 06:06:45,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 3204. [2025-01-09 06:06:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3204 states, 2771 states have (on average 1.3969686033922772) internal successors, (3871), 2796 states have internal predecessors, (3871), 264 states have call successors, (264), 144 states have call predecessors, (264), 168 states have return successors, (319), 267 states have call predecessors, (319), 264 states have call successors, (319) [2025-01-09 06:06:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 4454 transitions. [2025-01-09 06:06:45,152 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 4454 transitions. Word has length 77 [2025-01-09 06:06:45,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:45,153 INFO L471 AbstractCegarLoop]: Abstraction has 3204 states and 4454 transitions. [2025-01-09 06:06:45,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 4454 transitions. [2025-01-09 06:06:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:45,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:45,155 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] [2025-01-09 06:06:45,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 06:06:45,158 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:45,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:45,158 INFO L85 PathProgramCache]: Analyzing trace with hash -298396577, now seen corresponding path program 1 times [2025-01-09 06:06:45,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:45,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250798455] [2025-01-09 06:06:45,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:45,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:45,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:45,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:45,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:45,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:45,262 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:06:45,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:45,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250798455] [2025-01-09 06:06:45,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250798455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:45,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:45,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:45,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008805787] [2025-01-09 06:06:45,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:45,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:45,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:45,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:45,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:45,266 INFO L87 Difference]: Start difference. First operand 3204 states and 4454 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:45,723 INFO L93 Difference]: Finished difference Result 4480 states and 6276 transitions. [2025-01-09 06:06:45,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:45,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-01-09 06:06:45,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:45,744 INFO L225 Difference]: With dead ends: 4480 [2025-01-09 06:06:45,745 INFO L226 Difference]: Without dead ends: 2286 [2025-01-09 06:06:45,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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:06:45,751 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 351 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:45,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 733 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:45,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2025-01-09 06:06:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2136. [2025-01-09 06:06:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 1851 states have (on average 1.3954619124797407) internal successors, (2583), 1860 states have internal predecessors, (2583), 180 states have call successors, (180), 96 states have call predecessors, (180), 104 states have return successors, (193), 181 states have call predecessors, (193), 180 states have call successors, (193) [2025-01-09 06:06:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 2956 transitions. [2025-01-09 06:06:45,978 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 2956 transitions. Word has length 77 [2025-01-09 06:06:45,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:45,979 INFO L471 AbstractCegarLoop]: Abstraction has 2136 states and 2956 transitions. [2025-01-09 06:06:45,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:45,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 2956 transitions. [2025-01-09 06:06:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:45,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:45,980 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] [2025-01-09 06:06:45,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 06:06:45,980 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:45,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:45,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2103834911, now seen corresponding path program 1 times [2025-01-09 06:06:45,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:45,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327748085] [2025-01-09 06:06:45,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:45,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:45,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:45,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:45,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:45,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:46,079 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:06:46,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:46,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327748085] [2025-01-09 06:06:46,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327748085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:46,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:46,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:46,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350195453] [2025-01-09 06:06:46,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:46,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:46,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:46,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:46,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:46,082 INFO L87 Difference]: Start difference. First operand 2136 states and 2956 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:46,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:46,454 INFO L93 Difference]: Finished difference Result 4258 states and 5919 transitions. [2025-01-09 06:06:46,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:46,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-01-09 06:06:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:46,468 INFO L225 Difference]: With dead ends: 4258 [2025-01-09 06:06:46,469 INFO L226 Difference]: Without dead ends: 2136 [2025-01-09 06:06:46,476 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:06:46,478 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 264 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:46,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 374 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:46,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2025-01-09 06:06:46,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2136. [2025-01-09 06:06:46,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 1851 states have (on average 1.3803349540788763) internal successors, (2555), 1860 states have internal predecessors, (2555), 180 states have call successors, (180), 96 states have call predecessors, (180), 104 states have return successors, (193), 181 states have call predecessors, (193), 180 states have call successors, (193) [2025-01-09 06:06:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 2928 transitions. [2025-01-09 06:06:46,693 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 2928 transitions. Word has length 77 [2025-01-09 06:06:46,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:46,693 INFO L471 AbstractCegarLoop]: Abstraction has 2136 states and 2928 transitions. [2025-01-09 06:06:46,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:46,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 2928 transitions. [2025-01-09 06:06:46,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:46,696 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:46,696 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] [2025-01-09 06:06:46,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 06:06:46,696 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:46,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:46,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1884980193, now seen corresponding path program 1 times [2025-01-09 06:06:46,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:46,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594760279] [2025-01-09 06:06:46,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:46,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:46,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:46,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:46,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:46,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:46,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:46,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594760279] [2025-01-09 06:06:46,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594760279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:46,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:46,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:46,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42087073] [2025-01-09 06:06:46,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:46,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:46,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:46,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:46,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:46,793 INFO L87 Difference]: Start difference. First operand 2136 states and 2928 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:47,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:47,222 INFO L93 Difference]: Finished difference Result 4819 states and 6635 transitions. [2025-01-09 06:06:47,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:47,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-01-09 06:06:47,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:47,235 INFO L225 Difference]: With dead ends: 4819 [2025-01-09 06:06:47,236 INFO L226 Difference]: Without dead ends: 2696 [2025-01-09 06:06:47,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:06:47,242 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 332 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:47,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 373 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2025-01-09 06:06:47,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2432. [2025-01-09 06:06:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2432 states, 2123 states have (on average 1.3429109750353274) internal successors, (2851), 2132 states have internal predecessors, (2851), 188 states have call successors, (188), 112 states have call predecessors, (188), 120 states have return successors, (217), 189 states have call predecessors, (217), 188 states have call successors, (217) [2025-01-09 06:06:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 3256 transitions. [2025-01-09 06:06:47,431 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 3256 transitions. Word has length 77 [2025-01-09 06:06:47,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:47,432 INFO L471 AbstractCegarLoop]: Abstraction has 2432 states and 3256 transitions. [2025-01-09 06:06:47,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:47,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 3256 transitions. [2025-01-09 06:06:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:47,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:47,433 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] [2025-01-09 06:06:47,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 06:06:47,434 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:47,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:47,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1462278367, now seen corresponding path program 1 times [2025-01-09 06:06:47,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:47,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796580109] [2025-01-09 06:06:47,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:47,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:47,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:47,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:47,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:47,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:47,533 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:06:47,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:47,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796580109] [2025-01-09 06:06:47,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796580109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:47,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:47,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:47,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330597553] [2025-01-09 06:06:47,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:47,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:47,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:47,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:47,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:47,534 INFO L87 Difference]: Start difference. First operand 2432 states and 3256 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:48,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:48,063 INFO L93 Difference]: Finished difference Result 4514 states and 6066 transitions. [2025-01-09 06:06:48,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:48,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-01-09 06:06:48,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:48,078 INFO L225 Difference]: With dead ends: 4514 [2025-01-09 06:06:48,078 INFO L226 Difference]: Without dead ends: 2646 [2025-01-09 06:06:48,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 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:06:48,085 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 344 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:48,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 688 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:48,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2025-01-09 06:06:48,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2416. [2025-01-09 06:06:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 2111 states have (on average 1.3391757460918996) internal successors, (2827), 2116 states have internal predecessors, (2827), 188 states have call successors, (188), 112 states have call predecessors, (188), 116 states have return successors, (208), 188 states have call predecessors, (208), 188 states have call successors, (208) [2025-01-09 06:06:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3223 transitions. [2025-01-09 06:06:48,239 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3223 transitions. Word has length 77 [2025-01-09 06:06:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:48,240 INFO L471 AbstractCegarLoop]: Abstraction has 2416 states and 3223 transitions. [2025-01-09 06:06:48,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:48,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3223 transitions. [2025-01-09 06:06:48,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:48,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:48,241 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] [2025-01-09 06:06:48,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 06:06:48,241 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:48,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:48,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2015040479, now seen corresponding path program 1 times [2025-01-09 06:06:48,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:48,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022039541] [2025-01-09 06:06:48,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:48,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:48,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:48,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:48,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:48,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:48,315 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:06:48,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:48,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022039541] [2025-01-09 06:06:48,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022039541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:48,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:48,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:48,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853338073] [2025-01-09 06:06:48,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:48,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:48,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:48,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:48,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:48,317 INFO L87 Difference]: Start difference. First operand 2416 states and 3223 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:48,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:48,685 INFO L93 Difference]: Finished difference Result 5414 states and 7195 transitions. [2025-01-09 06:06:48,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:48,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-01-09 06:06:48,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:48,700 INFO L225 Difference]: With dead ends: 5414 [2025-01-09 06:06:48,700 INFO L226 Difference]: Without dead ends: 3012 [2025-01-09 06:06:48,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:06:48,706 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 290 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:48,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 368 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3012 states. [2025-01-09 06:06:48,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3012 to 2972. [2025-01-09 06:06:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2972 states, 2622 states have (on average 1.2929061784897025) internal successors, (3390), 2627 states have internal predecessors, (3390), 202 states have call successors, (202), 142 states have call predecessors, (202), 147 states have return successors, (238), 203 states have call predecessors, (238), 202 states have call successors, (238) [2025-01-09 06:06:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 3830 transitions. [2025-01-09 06:06:48,919 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 3830 transitions. Word has length 77 [2025-01-09 06:06:48,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:48,919 INFO L471 AbstractCegarLoop]: Abstraction has 2972 states and 3830 transitions. [2025-01-09 06:06:48,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 3830 transitions. [2025-01-09 06:06:48,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 06:06:48,920 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:48,921 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] [2025-01-09 06:06:48,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 06:06:48,922 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:48,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:48,922 INFO L85 PathProgramCache]: Analyzing trace with hash 20895773, now seen corresponding path program 1 times [2025-01-09 06:06:48,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:48,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322092974] [2025-01-09 06:06:48,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:48,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:48,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 06:06:48,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 06:06:48,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:48,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:48,958 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:06:48,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:48,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322092974] [2025-01-09 06:06:48,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322092974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:48,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:48,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:06:48,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135098278] [2025-01-09 06:06:48,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:48,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:06:48,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:48,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:06:48,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:06:48,960 INFO L87 Difference]: Start difference. First operand 2972 states and 3830 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 06:06:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:49,183 INFO L93 Difference]: Finished difference Result 7569 states and 9861 transitions. [2025-01-09 06:06:49,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:06:49,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 77 [2025-01-09 06:06:49,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:49,203 INFO L225 Difference]: With dead ends: 7569 [2025-01-09 06:06:49,203 INFO L226 Difference]: Without dead ends: 4610 [2025-01-09 06:06:49,211 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:06:49,212 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 184 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:49,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 403 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2025-01-09 06:06:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4596. [2025-01-09 06:06:49,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4596 states, 4051 states have (on average 1.2863490496173784) internal successors, (5211), 4072 states have internal predecessors, (5211), 314 states have call successors, (314), 222 states have call predecessors, (314), 230 states have return successors, (357), 302 states have call predecessors, (357), 314 states have call successors, (357) [2025-01-09 06:06:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4596 states to 4596 states and 5882 transitions. [2025-01-09 06:06:49,482 INFO L78 Accepts]: Start accepts. Automaton has 4596 states and 5882 transitions. Word has length 77 [2025-01-09 06:06:49,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:49,482 INFO L471 AbstractCegarLoop]: Abstraction has 4596 states and 5882 transitions. [2025-01-09 06:06:49,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-09 06:06:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 4596 states and 5882 transitions. [2025-01-09 06:06:49,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 06:06:49,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:49,486 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:49,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 06:06:49,486 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:49,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:49,487 INFO L85 PathProgramCache]: Analyzing trace with hash 423647086, now seen corresponding path program 1 times [2025-01-09 06:06:49,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:49,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481075787] [2025-01-09 06:06:49,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:49,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:49,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 06:06:49,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 06:06:49,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:49,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 06:06:49,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:49,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481075787] [2025-01-09 06:06:49,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481075787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:49,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:49,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:49,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340084242] [2025-01-09 06:06:49,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:49,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:49,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:49,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:49,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:49,620 INFO L87 Difference]: Start difference. First operand 4596 states and 5882 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 06:06:50,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:50,275 INFO L93 Difference]: Finished difference Result 14271 states and 18324 transitions. [2025-01-09 06:06:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:50,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 125 [2025-01-09 06:06:50,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:50,323 INFO L225 Difference]: With dead ends: 14271 [2025-01-09 06:06:50,324 INFO L226 Difference]: Without dead ends: 9689 [2025-01-09 06:06:50,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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:06:50,340 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 287 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:50,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 504 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:50,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9689 states. [2025-01-09 06:06:51,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9689 to 9659. [2025-01-09 06:06:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9659 states, 8524 states have (on average 1.2699436884091975) internal successors, (10825), 8598 states have internal predecessors, (10825), 613 states have call successors, (613), 442 states have call predecessors, (613), 521 states have return successors, (877), 620 states have call predecessors, (877), 613 states have call successors, (877) [2025-01-09 06:06:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9659 states to 9659 states and 12315 transitions. [2025-01-09 06:06:51,069 INFO L78 Accepts]: Start accepts. Automaton has 9659 states and 12315 transitions. Word has length 125 [2025-01-09 06:06:51,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:51,069 INFO L471 AbstractCegarLoop]: Abstraction has 9659 states and 12315 transitions. [2025-01-09 06:06:51,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 06:06:51,070 INFO L276 IsEmpty]: Start isEmpty. Operand 9659 states and 12315 transitions. [2025-01-09 06:06:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 06:06:51,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:51,075 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:51,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 06:06:51,076 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:51,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:51,076 INFO L85 PathProgramCache]: Analyzing trace with hash 91003948, now seen corresponding path program 1 times [2025-01-09 06:06:51,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:51,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022764452] [2025-01-09 06:06:51,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:51,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:51,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 06:06:51,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 06:06:51,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:51,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 06:06:51,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:51,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022764452] [2025-01-09 06:06:51,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022764452] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:51,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:51,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:06:51,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685533522] [2025-01-09 06:06:51,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:51,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:06:51,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:51,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:06:51,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:06:51,117 INFO L87 Difference]: Start difference. First operand 9659 states and 12315 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:51,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:51,581 INFO L93 Difference]: Finished difference Result 17153 states and 21855 transitions. [2025-01-09 06:06:51,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:06:51,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 125 [2025-01-09 06:06:51,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:51,617 INFO L225 Difference]: With dead ends: 17153 [2025-01-09 06:06:51,617 INFO L226 Difference]: Without dead ends: 7508 [2025-01-09 06:06:51,632 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:06:51,633 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 208 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 215 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:06:51,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 215 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:51,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7508 states. [2025-01-09 06:06:52,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7508 to 7508. [2025-01-09 06:06:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7508 states, 6638 states have (on average 1.2699608315757758) internal successors, (8430), 6701 states have internal predecessors, (8430), 462 states have call successors, (462), 332 states have call predecessors, (462), 407 states have return successors, (669), 475 states have call predecessors, (669), 462 states have call successors, (669) [2025-01-09 06:06:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7508 states to 7508 states and 9561 transitions. [2025-01-09 06:06:52,081 INFO L78 Accepts]: Start accepts. Automaton has 7508 states and 9561 transitions. Word has length 125 [2025-01-09 06:06:52,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:52,082 INFO L471 AbstractCegarLoop]: Abstraction has 7508 states and 9561 transitions. [2025-01-09 06:06:52,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:52,082 INFO L276 IsEmpty]: Start isEmpty. Operand 7508 states and 9561 transitions. [2025-01-09 06:06:52,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 06:06:52,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:52,087 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:52,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 06:06:52,089 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:52,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:52,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1749412847, now seen corresponding path program 1 times [2025-01-09 06:06:52,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:52,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621846469] [2025-01-09 06:06:52,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:52,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:52,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 06:06:52,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 06:06:52,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:52,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 06:06:52,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:52,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621846469] [2025-01-09 06:06:52,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621846469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:52,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:52,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:52,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058222450] [2025-01-09 06:06:52,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:52,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:52,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:52,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:52,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:52,184 INFO L87 Difference]: Start difference. First operand 7508 states and 9561 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 06:06:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:53,162 INFO L93 Difference]: Finished difference Result 22053 states and 28077 transitions. [2025-01-09 06:06:53,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:53,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 127 [2025-01-09 06:06:53,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:53,235 INFO L225 Difference]: With dead ends: 22053 [2025-01-09 06:06:53,235 INFO L226 Difference]: Without dead ends: 14559 [2025-01-09 06:06:53,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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:06:53,263 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 265 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:53,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 541 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:53,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14559 states. [2025-01-09 06:06:54,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14559 to 13979. [2025-01-09 06:06:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13979 states, 12255 states have (on average 1.2617707058343532) internal successors, (15463), 12449 states have internal predecessors, (15463), 851 states have call successors, (851), 592 states have call predecessors, (851), 872 states have return successors, (1536), 939 states have call predecessors, (1536), 851 states have call successors, (1536) [2025-01-09 06:06:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13979 states to 13979 states and 17850 transitions. [2025-01-09 06:06:54,361 INFO L78 Accepts]: Start accepts. Automaton has 13979 states and 17850 transitions. Word has length 127 [2025-01-09 06:06:54,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:54,362 INFO L471 AbstractCegarLoop]: Abstraction has 13979 states and 17850 transitions. [2025-01-09 06:06:54,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 06:06:54,362 INFO L276 IsEmpty]: Start isEmpty. Operand 13979 states and 17850 transitions. [2025-01-09 06:06:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 06:06:54,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:54,370 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:54,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 06:06:54,371 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:54,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:54,372 INFO L85 PathProgramCache]: Analyzing trace with hash 27410161, now seen corresponding path program 1 times [2025-01-09 06:06:54,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:54,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278628252] [2025-01-09 06:06:54,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:54,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:54,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 06:06:54,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 06:06:54,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:54,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:54,424 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 06:06:54,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:54,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278628252] [2025-01-09 06:06:54,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278628252] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:54,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:54,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:06:54,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713044547] [2025-01-09 06:06:54,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:54,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:06:54,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:54,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:06:54,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:06:54,428 INFO L87 Difference]: Start difference. First operand 13979 states and 17850 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:55,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:55,617 INFO L93 Difference]: Finished difference Result 27940 states and 35671 transitions. [2025-01-09 06:06:55,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:06:55,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 127 [2025-01-09 06:06:55,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:55,685 INFO L225 Difference]: With dead ends: 27940 [2025-01-09 06:06:55,686 INFO L226 Difference]: Without dead ends: 13974 [2025-01-09 06:06:55,716 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:06:55,717 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 206 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 214 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:06:55,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 214 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:55,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13974 states. [2025-01-09 06:06:56,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13974 to 13974. [2025-01-09 06:06:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13974 states, 12253 states have (on average 1.261650208112299) internal successors, (15459), 12446 states have internal predecessors, (15459), 848 states have call successors, (848), 592 states have call predecessors, (848), 872 states have return successors, (1532), 936 states have call predecessors, (1532), 848 states have call successors, (1532) [2025-01-09 06:06:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13974 states to 13974 states and 17839 transitions. [2025-01-09 06:06:56,787 INFO L78 Accepts]: Start accepts. Automaton has 13974 states and 17839 transitions. Word has length 127 [2025-01-09 06:06:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:56,788 INFO L471 AbstractCegarLoop]: Abstraction has 13974 states and 17839 transitions. [2025-01-09 06:06:56,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:56,788 INFO L276 IsEmpty]: Start isEmpty. Operand 13974 states and 17839 transitions. [2025-01-09 06:06:56,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 06:06:56,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:56,796 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:56,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 06:06:56,796 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:56,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:56,797 INFO L85 PathProgramCache]: Analyzing trace with hash -137122450, now seen corresponding path program 1 times [2025-01-09 06:06:56,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:56,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078645178] [2025-01-09 06:06:56,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:56,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:56,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 06:06:56,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 06:06:56,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:56,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 06:06:56,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:56,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078645178] [2025-01-09 06:06:56,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078645178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:56,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:56,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:56,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812127991] [2025-01-09 06:06:56,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:56,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:56,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:56,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:56,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:56,903 INFO L87 Difference]: Start difference. First operand 13974 states and 17839 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 06:06:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:58,804 INFO L93 Difference]: Finished difference Result 39654 states and 50754 transitions. [2025-01-09 06:06:58,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:58,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 129 [2025-01-09 06:06:58,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:58,931 INFO L225 Difference]: With dead ends: 39654 [2025-01-09 06:06:58,931 INFO L226 Difference]: Without dead ends: 25694 [2025-01-09 06:06:58,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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:06:58,962 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 256 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:58,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 483 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:58,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25694 states. [2025-01-09 06:07:01,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25694 to 25692. [2025-01-09 06:07:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25692 states, 22420 states have (on average 1.2604817127564674) internal successors, (28260), 22794 states have internal predecessors, (28260), 1623 states have call successors, (1623), 1112 states have call predecessors, (1623), 1648 states have return successors, (2931), 1787 states have call predecessors, (2931), 1623 states have call successors, (2931) [2025-01-09 06:07:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25692 states to 25692 states and 32814 transitions. [2025-01-09 06:07:01,226 INFO L78 Accepts]: Start accepts. Automaton has 25692 states and 32814 transitions. Word has length 129 [2025-01-09 06:07:01,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:01,227 INFO L471 AbstractCegarLoop]: Abstraction has 25692 states and 32814 transitions. [2025-01-09 06:07:01,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-09 06:07:01,227 INFO L276 IsEmpty]: Start isEmpty. Operand 25692 states and 32814 transitions. [2025-01-09 06:07:01,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 06:07:01,238 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:01,238 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:01,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 06:07:01,238 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:01,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:01,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1979598164, now seen corresponding path program 1 times [2025-01-09 06:07:01,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:01,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308746284] [2025-01-09 06:07:01,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:01,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:01,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 06:07:01,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 06:07:01,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:01,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 06:07:01,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:01,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308746284] [2025-01-09 06:07:01,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308746284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:01,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:01,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:07:01,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204580699] [2025-01-09 06:07:01,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:01,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:07:01,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:01,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:07:01,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:07:01,282 INFO L87 Difference]: Start difference. First operand 25692 states and 32814 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:07:02,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:02,588 INFO L93 Difference]: Finished difference Result 45703 states and 58417 transitions. [2025-01-09 06:07:02,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:07:02,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 129 [2025-01-09 06:07:02,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:02,667 INFO L225 Difference]: With dead ends: 45703 [2025-01-09 06:07:02,667 INFO L226 Difference]: Without dead ends: 20025 [2025-01-09 06:07:02,716 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:02,717 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 204 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 213 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:02,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 213 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:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20025 states. [2025-01-09 06:07:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20025 to 20025. [2025-01-09 06:07:04,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20025 states, 17505 states have (on average 1.261753784632962) internal successors, (22087), 17800 states have internal predecessors, (22087), 1234 states have call successors, (1234), 852 states have call predecessors, (1234), 1285 states have return successors, (2301), 1373 states have call predecessors, (2301), 1234 states have call successors, (2301) [2025-01-09 06:07:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20025 states to 20025 states and 25622 transitions. [2025-01-09 06:07:04,126 INFO L78 Accepts]: Start accepts. Automaton has 20025 states and 25622 transitions. Word has length 129 [2025-01-09 06:07:04,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:04,126 INFO L471 AbstractCegarLoop]: Abstraction has 20025 states and 25622 transitions. [2025-01-09 06:07:04,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:07:04,127 INFO L276 IsEmpty]: Start isEmpty. Operand 20025 states and 25622 transitions. [2025-01-09 06:07:04,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 06:07:04,135 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:04,135 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:04,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 06:07:04,136 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:04,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:04,136 INFO L85 PathProgramCache]: Analyzing trace with hash -632380881, now seen corresponding path program 1 times [2025-01-09 06:07:04,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:04,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568887847] [2025-01-09 06:07:04,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:04,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:04,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 06:07:04,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 06:07:04,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:04,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:04,230 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 06:07:04,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:04,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568887847] [2025-01-09 06:07:04,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568887847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:04,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:04,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:07:04,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158544671] [2025-01-09 06:07:04,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:04,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:07:04,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:04,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:07:04,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:07:04,233 INFO L87 Difference]: Start difference. First operand 20025 states and 25622 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:07:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:07,371 INFO L93 Difference]: Finished difference Result 55976 states and 72210 transitions. [2025-01-09 06:07:07,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 06:07:07,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 131 [2025-01-09 06:07:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:07,502 INFO L225 Difference]: With dead ends: 55976 [2025-01-09 06:07:07,503 INFO L226 Difference]: Without dead ends: 28540 [2025-01-09 06:07:07,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-01-09 06:07:07,577 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 1436 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:07,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1448 Valid, 1143 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:07:07,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28540 states. [2025-01-09 06:07:09,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28540 to 28006. [2025-01-09 06:07:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28006 states, 24650 states have (on average 1.2437728194726165) internal successors, (30659), 25047 states have internal predecessors, (30659), 1576 states have call successors, (1576), 1152 states have call predecessors, (1576), 1779 states have return successors, (2923), 1807 states have call predecessors, (2923), 1576 states have call successors, (2923) [2025-01-09 06:07:09,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28006 states to 28006 states and 35158 transitions. [2025-01-09 06:07:09,618 INFO L78 Accepts]: Start accepts. Automaton has 28006 states and 35158 transitions. Word has length 131 [2025-01-09 06:07:09,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:09,619 INFO L471 AbstractCegarLoop]: Abstraction has 28006 states and 35158 transitions. [2025-01-09 06:07:09,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:07:09,619 INFO L276 IsEmpty]: Start isEmpty. Operand 28006 states and 35158 transitions. [2025-01-09 06:07:09,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-09 06:07:09,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:09,632 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:09,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 06:07:09,632 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:09,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:09,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2116465435, now seen corresponding path program 1 times [2025-01-09 06:07:09,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:09,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976167597] [2025-01-09 06:07:09,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:09,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:09,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-09 06:07:09,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-09 06:07:09,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:09,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 06:07:09,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:09,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976167597] [2025-01-09 06:07:09,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976167597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:09,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:09,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:09,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758937573] [2025-01-09 06:07:09,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:09,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:09,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:09,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:09,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:09,732 INFO L87 Difference]: Start difference. First operand 28006 states and 35158 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 06:07:12,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:12,238 INFO L93 Difference]: Finished difference Result 50286 states and 63410 transitions. [2025-01-09 06:07:12,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 06:07:12,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 189 [2025-01-09 06:07:12,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:12,338 INFO L225 Difference]: With dead ends: 50286 [2025-01-09 06:07:12,338 INFO L226 Difference]: Without dead ends: 28444 [2025-01-09 06:07:12,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-01-09 06:07:12,375 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 780 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:12,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 1020 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:07:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28444 states. [2025-01-09 06:07:14,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28444 to 28006. [2025-01-09 06:07:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28006 states, 24650 states have (on average 1.2414604462474645) internal successors, (30602), 25047 states have internal predecessors, (30602), 1576 states have call successors, (1576), 1152 states have call predecessors, (1576), 1779 states have return successors, (2914), 1807 states have call predecessors, (2914), 1576 states have call successors, (2914) [2025-01-09 06:07:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28006 states to 28006 states and 35092 transitions. [2025-01-09 06:07:14,175 INFO L78 Accepts]: Start accepts. Automaton has 28006 states and 35092 transitions. Word has length 189 [2025-01-09 06:07:14,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:14,175 INFO L471 AbstractCegarLoop]: Abstraction has 28006 states and 35092 transitions. [2025-01-09 06:07:14,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 4 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 06:07:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand 28006 states and 35092 transitions. [2025-01-09 06:07:14,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-09 06:07:14,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:14,192 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:14,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 06:07:14,193 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:14,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:14,193 INFO L85 PathProgramCache]: Analyzing trace with hash -51866121, now seen corresponding path program 1 times [2025-01-09 06:07:14,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:14,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652789523] [2025-01-09 06:07:14,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:14,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:14,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 06:07:14,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 06:07:14,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:14,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-01-09 06:07:14,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:14,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652789523] [2025-01-09 06:07:14,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652789523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:14,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:14,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:07:14,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933361239] [2025-01-09 06:07:14,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:14,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:07:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:14,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:07:14,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:07:14,246 INFO L87 Difference]: Start difference. First operand 28006 states and 35092 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 06:07:15,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:15,604 INFO L93 Difference]: Finished difference Result 60787 states and 76180 transitions. [2025-01-09 06:07:15,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:07:15,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 225 [2025-01-09 06:07:15,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:15,695 INFO L225 Difference]: With dead ends: 60787 [2025-01-09 06:07:15,695 INFO L226 Difference]: Without dead ends: 32794 [2025-01-09 06:07:15,743 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:15,744 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 140 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:15,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 443 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:07:15,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32794 states. [2025-01-09 06:07:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32794 to 32716. [2025-01-09 06:07:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32716 states, 28772 states have (on average 1.2358543027943834) internal successors, (35558), 29199 states have internal predecessors, (35558), 1900 states have call successors, (1900), 1380 states have call predecessors, (1900), 2043 states have return successors, (3308), 2137 states have call predecessors, (3308), 1900 states have call successors, (3308) [2025-01-09 06:07:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32716 states to 32716 states and 40766 transitions. [2025-01-09 06:07:18,695 INFO L78 Accepts]: Start accepts. Automaton has 32716 states and 40766 transitions. Word has length 225 [2025-01-09 06:07:18,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:18,695 INFO L471 AbstractCegarLoop]: Abstraction has 32716 states and 40766 transitions. [2025-01-09 06:07:18,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 06:07:18,696 INFO L276 IsEmpty]: Start isEmpty. Operand 32716 states and 40766 transitions. [2025-01-09 06:07:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-09 06:07:18,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:18,724 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:18,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 06:07:18,724 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:18,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:18,724 INFO L85 PathProgramCache]: Analyzing trace with hash -494513377, now seen corresponding path program 1 times [2025-01-09 06:07:18,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:18,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266124536] [2025-01-09 06:07:18,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:18,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:18,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 06:07:18,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 06:07:18,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:18,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:18,844 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-01-09 06:07:18,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:18,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266124536] [2025-01-09 06:07:18,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266124536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:18,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:18,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:18,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21020899] [2025-01-09 06:07:18,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:18,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:18,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:18,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:18,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:18,846 INFO L87 Difference]: Start difference. First operand 32716 states and 40766 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)