./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.09.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/Problem05_label43+token_ring.09.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 5ab060d6e8ec67586454a3fd3cad3b6749e261734a1b9e4129e037a184a704d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:18:47,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:18:47,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:18:47,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:18:47,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:18:47,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:18:47,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:18:47,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:18:47,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:18:47,211 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:18:47,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:18:47,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:18:47,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:18:47,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:18:47,212 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:18:47,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:18:47,212 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:18:47,212 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:18:47,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:18:47,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:18:47,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:18:47,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:18:47,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:18:47,212 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:18:47,212 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:18:47,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:18:47,212 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:18:47,213 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:18:47,213 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:18:47,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:18:47,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:18:47,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:18:47,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:18:47,213 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:18:47,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:18:47,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:18:47,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:18:47,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:18:47,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:18:47,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:18:47,216 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:18:47,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:18:47,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:18:47,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:18:47,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:18:47,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:18:47,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:18:47,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:18:47,216 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 -> 5ab060d6e8ec67586454a3fd3cad3b6749e261734a1b9e4129e037a184a704d9 [2025-01-09 05:18:47,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:18:47,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:18:47,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:18:47,528 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:18:47,528 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:18:47,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.09.cil-2.c [2025-01-09 05:18:48,864 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d237f33fd/3f4d532349d34d7283c9a7f7b20e28ef/FLAG99935349e [2025-01-09 05:18:49,514 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:18:49,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.09.cil-2.c [2025-01-09 05:18:49,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d237f33fd/3f4d532349d34d7283c9a7f7b20e28ef/FLAG99935349e [2025-01-09 05:18:49,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d237f33fd/3f4d532349d34d7283c9a7f7b20e28ef [2025-01-09 05:18:49,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:18:49,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:18:49,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:18:49,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:18:49,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:18:49,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:18:49" (1/1) ... [2025-01-09 05:18:49,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b67e9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:49, skipping insertion in model container [2025-01-09 05:18:49,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:18:49" (1/1) ... [2025-01-09 05:18:49,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:18:51,186 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/Problem05_label43+token_ring.09.cil-2.c[381679,381692] [2025-01-09 05:18:51,226 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/Problem05_label43+token_ring.09.cil-2.c[383339,383352] [2025-01-09 05:18:51,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:18:51,503 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:18:52,156 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/Problem05_label43+token_ring.09.cil-2.c[381679,381692] [2025-01-09 05:18:52,161 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/Problem05_label43+token_ring.09.cil-2.c[383339,383352] [2025-01-09 05:18:52,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:18:52,249 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:18:52,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:52 WrapperNode [2025-01-09 05:18:52,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:18:52,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:18:52,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:18:52,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:18:52,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:52" (1/1) ... [2025-01-09 05:18:52,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:52" (1/1) ... [2025-01-09 05:18:52,719 INFO L138 Inliner]: procedures = 62, calls = 69, calls flagged for inlining = 39, calls inlined = 39, statements flattened = 13020 [2025-01-09 05:18:52,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:18:52,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:18:52,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:18:52,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:18:52,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:52" (1/1) ... [2025-01-09 05:18:52,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:52" (1/1) ... [2025-01-09 05:18:52,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:52" (1/1) ... [2025-01-09 05:18:52,887 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 05:18:52,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:52" (1/1) ... [2025-01-09 05:18:52,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:52" (1/1) ... [2025-01-09 05:18:53,242 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:52" (1/1) ... [2025-01-09 05:18:53,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:52" (1/1) ... [2025-01-09 05:18:53,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:52" (1/1) ... [2025-01-09 05:18:53,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:52" (1/1) ... [2025-01-09 05:18:53,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:52" (1/1) ... [2025-01-09 05:18:53,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:18:53,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:18:53,471 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:18:53,471 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:18:53,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:52" (1/1) ... [2025-01-09 05:18:53,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:18:53,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:18:53,506 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 05:18:53,511 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 05:18:53,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:18:53,537 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:18:53,537 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:18:53,537 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:18:53,537 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:18:53,538 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:18:53,538 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:18:53,538 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 05:18:53,538 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 05:18:53,538 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:18:53,538 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:18:53,538 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:18:53,538 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:18:53,538 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:18:53,538 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:18:53,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:18:53,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:18:53,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:18:53,673 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:18:53,675 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:19:02,009 INFO L? ?]: Removed 1741 outVars from TransFormulas that were not future-live. [2025-01-09 05:19:02,010 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:19:02,083 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:19:02,085 INFO L312 CfgBuilder]: Removed 13 assume(true) statements. [2025-01-09 05:19:02,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:19:02 BoogieIcfgContainer [2025-01-09 05:19:02,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:19:02,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:19:02,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:19:02,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:19:02,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:18:49" (1/3) ... [2025-01-09 05:19:02,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6213789b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:19:02, skipping insertion in model container [2025-01-09 05:19:02,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:52" (2/3) ... [2025-01-09 05:19:02,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6213789b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:19:02, skipping insertion in model container [2025-01-09 05:19:02,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:19:02" (3/3) ... [2025-01-09 05:19:02,096 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.09.cil-2.c [2025-01-09 05:19:02,110 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:19:02,113 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.09.cil-2.c that has 8 procedures, 2496 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-01-09 05:19:02,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:19:02,245 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;@3ff7e8d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:19:02,245 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:19:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand has 2496 states, 2462 states have (on average 1.8419983753046303) internal successors, (4535), 2466 states have internal predecessors, (4535), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 05:19:02,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:19:02,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:02,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:02,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:02,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:02,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2082065581, now seen corresponding path program 1 times [2025-01-09 05:19:02,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:02,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173623616] [2025-01-09 05:19:02,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:02,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:02,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:19:02,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:19:02,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:02,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:02,720 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 05:19:02,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:02,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173623616] [2025-01-09 05:19:02,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173623616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:02,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:02,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:19:02,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019275463] [2025-01-09 05:19:02,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:02,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:19:02,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:02,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:19:02,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:19:02,761 INFO L87 Difference]: Start difference. First operand has 2496 states, 2462 states have (on average 1.8419983753046303) internal successors, (4535), 2466 states have internal predecessors, (4535), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:02,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:02,987 INFO L93 Difference]: Finished difference Result 4982 states and 9153 transitions. [2025-01-09 05:19:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:19:02,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:19:02,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:03,022 INFO L225 Difference]: With dead ends: 4982 [2025-01-09 05:19:03,023 INFO L226 Difference]: Without dead ends: 2428 [2025-01-09 05:19:03,035 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 05:19:03,039 INFO L435 NwaCegarLoop]: 4507 mSDtfsCounter, 477 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 8529 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 05:19:03,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 8529 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:19:03,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2025-01-09 05:19:03,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 2428. [2025-01-09 05:19:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2428 states, 2395 states have (on average 1.8334029227557411) internal successors, (4391), 2398 states have internal predecessors, (4391), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 05:19:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 4439 transitions. [2025-01-09 05:19:03,203 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 4439 transitions. Word has length 144 [2025-01-09 05:19:03,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:03,205 INFO L471 AbstractCegarLoop]: Abstraction has 2428 states and 4439 transitions. [2025-01-09 05:19:03,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:03,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 4439 transitions. [2025-01-09 05:19:03,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:19:03,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:03,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:03,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:19:03,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:03,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:03,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1924082325, now seen corresponding path program 1 times [2025-01-09 05:19:03,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:03,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106339666] [2025-01-09 05:19:03,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:03,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:03,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:19:03,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:19:03,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:03,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:19:03,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:03,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106339666] [2025-01-09 05:19:03,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106339666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:03,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:03,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:19:03,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088727635] [2025-01-09 05:19:03,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:03,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:19:03,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:03,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:19:03,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:19:03,536 INFO L87 Difference]: Start difference. First operand 2428 states and 4439 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:04,251 INFO L93 Difference]: Finished difference Result 3044 states and 5419 transitions. [2025-01-09 05:19:04,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:19:04,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:19:04,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:04,267 INFO L225 Difference]: With dead ends: 3044 [2025-01-09 05:19:04,268 INFO L226 Difference]: Without dead ends: 2754 [2025-01-09 05:19:04,270 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 05:19:04,271 INFO L435 NwaCegarLoop]: 4332 mSDtfsCounter, 4865 mSDsluCounter, 8865 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4882 SdHoareTripleChecker+Valid, 13197 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:04,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4882 Valid, 13197 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:19:04,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2025-01-09 05:19:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2729. [2025-01-09 05:19:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2729 states, 2671 states have (on average 1.809060277049794) internal successors, (4832), 2675 states have internal predecessors, (4832), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-01-09 05:19:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 4917 transitions. [2025-01-09 05:19:04,358 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 4917 transitions. Word has length 144 [2025-01-09 05:19:04,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:04,360 INFO L471 AbstractCegarLoop]: Abstraction has 2729 states and 4917 transitions. [2025-01-09 05:19:04,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 4917 transitions. [2025-01-09 05:19:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:19:04,364 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:04,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:04,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:19:04,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:04,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:04,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1841760913, now seen corresponding path program 1 times [2025-01-09 05:19:04,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:04,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430662705] [2025-01-09 05:19:04,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:04,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:04,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:19:04,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:19:04,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:04,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:04,637 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 05:19:04,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:04,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430662705] [2025-01-09 05:19:04,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430662705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:04,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:04,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:19:04,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078234765] [2025-01-09 05:19:04,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:04,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:19:04,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:04,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:19:04,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:19:04,642 INFO L87 Difference]: Start difference. First operand 2729 states and 4917 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:05,511 INFO L93 Difference]: Finished difference Result 3705 states and 6484 transitions. [2025-01-09 05:19:05,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:19:05,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:19:05,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:05,654 INFO L225 Difference]: With dead ends: 3705 [2025-01-09 05:19:05,654 INFO L226 Difference]: Without dead ends: 3114 [2025-01-09 05:19:05,656 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 05:19:05,656 INFO L435 NwaCegarLoop]: 4589 mSDtfsCounter, 4868 mSDsluCounter, 13793 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4885 SdHoareTripleChecker+Valid, 18382 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:05,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4885 Valid, 18382 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:19:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2025-01-09 05:19:05,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 3009. [2025-01-09 05:19:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3009 states, 2926 states have (on average 1.7877648667122352) internal successors, (5231), 2931 states have internal predecessors, (5231), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (63), 60 states have call predecessors, (63), 59 states have call successors, (63) [2025-01-09 05:19:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3009 states to 3009 states and 5355 transitions. [2025-01-09 05:19:05,765 INFO L78 Accepts]: Start accepts. Automaton has 3009 states and 5355 transitions. Word has length 144 [2025-01-09 05:19:05,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:05,765 INFO L471 AbstractCegarLoop]: Abstraction has 3009 states and 5355 transitions. [2025-01-09 05:19:05,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:05,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3009 states and 5355 transitions. [2025-01-09 05:19:05,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:19:05,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:05,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:05,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:19:05,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:05,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:05,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1591372781, now seen corresponding path program 1 times [2025-01-09 05:19:05,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:05,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182743095] [2025-01-09 05:19:05,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:05,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:05,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:19:05,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:19:05,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:05,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:06,023 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 05:19:06,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:06,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182743095] [2025-01-09 05:19:06,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182743095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:06,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:06,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:19:06,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719961022] [2025-01-09 05:19:06,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:06,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:19:06,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:06,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:19:06,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:19:06,027 INFO L87 Difference]: Start difference. First operand 3009 states and 5355 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:06,897 INFO L93 Difference]: Finished difference Result 4589 states and 7885 transitions. [2025-01-09 05:19:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:19:06,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:19:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:06,918 INFO L225 Difference]: With dead ends: 4589 [2025-01-09 05:19:06,918 INFO L226 Difference]: Without dead ends: 3718 [2025-01-09 05:19:06,923 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 05:19:06,924 INFO L435 NwaCegarLoop]: 4581 mSDtfsCounter, 4860 mSDsluCounter, 13771 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4877 SdHoareTripleChecker+Valid, 18352 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:06,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4877 Valid, 18352 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:19:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2025-01-09 05:19:07,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3603. [2025-01-09 05:19:07,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3603 states, 3468 states have (on average 1.7560553633217992) internal successors, (6090), 3477 states have internal predecessors, (6090), 97 states have call successors, (97), 31 states have call predecessors, (97), 36 states have return successors, (111), 98 states have call predecessors, (111), 95 states have call successors, (111) [2025-01-09 05:19:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 3603 states and 6298 transitions. [2025-01-09 05:19:07,090 INFO L78 Accepts]: Start accepts. Automaton has 3603 states and 6298 transitions. Word has length 144 [2025-01-09 05:19:07,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:07,090 INFO L471 AbstractCegarLoop]: Abstraction has 3603 states and 6298 transitions. [2025-01-09 05:19:07,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:07,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3603 states and 6298 transitions. [2025-01-09 05:19:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:19:07,093 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:07,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:07,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:19:07,094 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:07,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:07,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1103325675, now seen corresponding path program 1 times [2025-01-09 05:19:07,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:07,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643195389] [2025-01-09 05:19:07,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:07,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:07,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:19:07,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:19:07,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:07,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:07,283 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 05:19:07,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:07,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643195389] [2025-01-09 05:19:07,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643195389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:07,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:07,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:19:07,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728217437] [2025-01-09 05:19:07,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:07,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:19:07,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:07,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:19:07,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:19:07,285 INFO L87 Difference]: Start difference. First operand 3603 states and 6298 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:08,146 INFO L93 Difference]: Finished difference Result 6499 states and 10974 transitions. [2025-01-09 05:19:08,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:19:08,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:19:08,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:08,176 INFO L225 Difference]: With dead ends: 6499 [2025-01-09 05:19:08,176 INFO L226 Difference]: Without dead ends: 5034 [2025-01-09 05:19:08,184 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 05:19:08,185 INFO L435 NwaCegarLoop]: 4578 mSDtfsCounter, 4855 mSDsluCounter, 13762 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4872 SdHoareTripleChecker+Valid, 18340 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:08,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4872 Valid, 18340 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:19:08,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5034 states. [2025-01-09 05:19:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5034 to 4890. [2025-01-09 05:19:08,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4890 states, 4645 states have (on average 1.7192680301399355) internal successors, (7986), 4668 states have internal predecessors, (7986), 169 states have call successors, (169), 55 states have call predecessors, (169), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-01-09 05:19:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4890 states to 4890 states and 8386 transitions. [2025-01-09 05:19:08,413 INFO L78 Accepts]: Start accepts. Automaton has 4890 states and 8386 transitions. Word has length 144 [2025-01-09 05:19:08,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:08,414 INFO L471 AbstractCegarLoop]: Abstraction has 4890 states and 8386 transitions. [2025-01-09 05:19:08,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:08,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4890 states and 8386 transitions. [2025-01-09 05:19:08,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:19:08,418 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:08,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:08,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:19:08,419 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:08,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:08,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2099006419, now seen corresponding path program 1 times [2025-01-09 05:19:08,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:08,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742434135] [2025-01-09 05:19:08,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:08,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:08,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:19:08,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:19:08,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:08,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:08,566 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 05:19:08,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:08,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742434135] [2025-01-09 05:19:08,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742434135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:08,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:08,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:19:08,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161322275] [2025-01-09 05:19:08,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:08,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:19:08,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:08,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:19:08,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:19:08,568 INFO L87 Difference]: Start difference. First operand 4890 states and 8386 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:09,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:09,545 INFO L93 Difference]: Finished difference Result 10696 states and 17948 transitions. [2025-01-09 05:19:09,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:19:09,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:19:09,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:09,592 INFO L225 Difference]: With dead ends: 10696 [2025-01-09 05:19:09,592 INFO L226 Difference]: Without dead ends: 7944 [2025-01-09 05:19:09,606 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 05:19:09,607 INFO L435 NwaCegarLoop]: 4575 mSDtfsCounter, 4850 mSDsluCounter, 13753 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4867 SdHoareTripleChecker+Valid, 18328 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:09,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4867 Valid, 18328 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:19:09,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7944 states. [2025-01-09 05:19:09,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7944 to 7743. [2025-01-09 05:19:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7743 states, 7260 states have (on average 1.6911845730027548) internal successors, (12278), 7329 states have internal predecessors, (12278), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-01-09 05:19:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7743 states to 7743 states and 13158 transitions. [2025-01-09 05:19:09,862 INFO L78 Accepts]: Start accepts. Automaton has 7743 states and 13158 transitions. Word has length 144 [2025-01-09 05:19:09,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:09,863 INFO L471 AbstractCegarLoop]: Abstraction has 7743 states and 13158 transitions. [2025-01-09 05:19:09,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 7743 states and 13158 transitions. [2025-01-09 05:19:09,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:19:09,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:09,869 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:09,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:19:09,869 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:09,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash 816834133, now seen corresponding path program 1 times [2025-01-09 05:19:09,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:09,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239796423] [2025-01-09 05:19:09,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:09,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:09,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:19:09,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:19:09,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:09,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:10,018 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 05:19:10,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:10,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239796423] [2025-01-09 05:19:10,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239796423] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:10,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:10,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:19:10,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045421508] [2025-01-09 05:19:10,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:10,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:19:10,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:10,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:19:10,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:19:10,021 INFO L87 Difference]: Start difference. First operand 7743 states and 13158 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:10,914 INFO L93 Difference]: Finished difference Result 20147 states and 34262 transitions. [2025-01-09 05:19:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:19:10,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:19:10,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:11,000 INFO L225 Difference]: With dead ends: 20147 [2025-01-09 05:19:11,001 INFO L226 Difference]: Without dead ends: 14542 [2025-01-09 05:19:11,031 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 05:19:11,032 INFO L435 NwaCegarLoop]: 4354 mSDtfsCounter, 4878 mSDsluCounter, 13229 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4895 SdHoareTripleChecker+Valid, 17583 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:11,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4895 Valid, 17583 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:19:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14542 states. [2025-01-09 05:19:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14542 to 14232. [2025-01-09 05:19:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14232 states, 13219 states have (on average 1.6837884862697632) internal successors, (22258), 13434 states have internal predecessors, (22258), 601 states have call successors, (601), 199 states have call predecessors, (601), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-01-09 05:19:11,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14232 states to 14232 states and 24482 transitions. [2025-01-09 05:19:11,662 INFO L78 Accepts]: Start accepts. Automaton has 14232 states and 24482 transitions. Word has length 144 [2025-01-09 05:19:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:11,662 INFO L471 AbstractCegarLoop]: Abstraction has 14232 states and 24482 transitions. [2025-01-09 05:19:11,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:11,663 INFO L276 IsEmpty]: Start isEmpty. Operand 14232 states and 24482 transitions. [2025-01-09 05:19:11,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:19:11,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:11,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:11,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:19:11,672 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:11,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:11,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1025641581, now seen corresponding path program 1 times [2025-01-09 05:19:11,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:11,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624226779] [2025-01-09 05:19:11,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:11,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:11,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:19:11,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:19:11,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:11,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:11,801 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 05:19:11,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:11,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624226779] [2025-01-09 05:19:11,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624226779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:11,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:11,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:19:11,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539529434] [2025-01-09 05:19:11,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:11,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:19:11,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:11,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:19:11,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:19:11,803 INFO L87 Difference]: Start difference. First operand 14232 states and 24482 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:12,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:12,625 INFO L93 Difference]: Finished difference Result 29756 states and 52195 transitions. [2025-01-09 05:19:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:19:12,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:19:12,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:12,721 INFO L225 Difference]: With dead ends: 29756 [2025-01-09 05:19:12,721 INFO L226 Difference]: Without dead ends: 17662 [2025-01-09 05:19:12,765 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 05:19:12,766 INFO L435 NwaCegarLoop]: 4309 mSDtfsCounter, 4598 mSDsluCounter, 8489 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4615 SdHoareTripleChecker+Valid, 12798 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:12,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4615 Valid, 12798 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:19:12,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17662 states. [2025-01-09 05:19:13,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17662 to 14232. [2025-01-09 05:19:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14232 states, 13219 states have (on average 1.6812920795824193) internal successors, (22225), 13434 states have internal predecessors, (22225), 601 states have call successors, (601), 199 states have call predecessors, (601), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-01-09 05:19:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14232 states to 14232 states and 24449 transitions. [2025-01-09 05:19:13,511 INFO L78 Accepts]: Start accepts. Automaton has 14232 states and 24449 transitions. Word has length 144 [2025-01-09 05:19:13,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:13,512 INFO L471 AbstractCegarLoop]: Abstraction has 14232 states and 24449 transitions. [2025-01-09 05:19:13,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:13,513 INFO L276 IsEmpty]: Start isEmpty. Operand 14232 states and 24449 transitions. [2025-01-09 05:19:13,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:19:13,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:13,522 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:13,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:19:13,522 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:13,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:13,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1547323029, now seen corresponding path program 1 times [2025-01-09 05:19:13,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:13,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720153074] [2025-01-09 05:19:13,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:13,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:13,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:19:13,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:19:13,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:13,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:13,715 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 05:19:13,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:13,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720153074] [2025-01-09 05:19:13,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720153074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:13,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:13,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:19:13,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739947079] [2025-01-09 05:19:13,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:13,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:19:13,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:13,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:19:13,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:19:13,717 INFO L87 Difference]: Start difference. First operand 14232 states and 24449 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:15,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:15,571 INFO L93 Difference]: Finished difference Result 41728 states and 73397 transitions. [2025-01-09 05:19:15,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:19:15,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:19:15,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:15,719 INFO L225 Difference]: With dead ends: 41728 [2025-01-09 05:19:15,720 INFO L226 Difference]: Without dead ends: 29634 [2025-01-09 05:19:15,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:19:15,765 INFO L435 NwaCegarLoop]: 4564 mSDtfsCounter, 4832 mSDsluCounter, 13721 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4849 SdHoareTripleChecker+Valid, 18285 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:15,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4849 Valid, 18285 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:19:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29634 states. [2025-01-09 05:19:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29634 to 29154. [2025-01-09 05:19:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29154 states, 26919 states have (on average 1.6917047438612132) internal successors, (45539), 27588 states have internal predecessors, (45539), 1177 states have call successors, (1177), 391 states have call predecessors, (1177), 1056 states have return successors, (5271), 1238 states have call predecessors, (5271), 1175 states have call successors, (5271) [2025-01-09 05:19:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29154 states to 29154 states and 51987 transitions. [2025-01-09 05:19:17,009 INFO L78 Accepts]: Start accepts. Automaton has 29154 states and 51987 transitions. Word has length 144 [2025-01-09 05:19:17,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:17,009 INFO L471 AbstractCegarLoop]: Abstraction has 29154 states and 51987 transitions. [2025-01-09 05:19:17,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:17,010 INFO L276 IsEmpty]: Start isEmpty. Operand 29154 states and 51987 transitions. [2025-01-09 05:19:17,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:19:17,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:17,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:17,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:19:17,024 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:17,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:17,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1214679891, now seen corresponding path program 1 times [2025-01-09 05:19:17,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:17,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540746365] [2025-01-09 05:19:17,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:17,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:17,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:19:17,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:19:17,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:17,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:17,185 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 05:19:17,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:17,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540746365] [2025-01-09 05:19:17,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540746365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:17,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:17,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:19:17,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93234437] [2025-01-09 05:19:17,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:17,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:19:17,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:17,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:19:17,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:19:17,187 INFO L87 Difference]: Start difference. First operand 29154 states and 51987 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:19,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:19,894 INFO L93 Difference]: Finished difference Result 92432 states and 172541 transitions. [2025-01-09 05:19:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:19:19,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:19:19,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:20,324 INFO L225 Difference]: With dead ends: 92432 [2025-01-09 05:19:20,324 INFO L226 Difference]: Without dead ends: 65416 [2025-01-09 05:19:20,467 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 05:19:20,468 INFO L435 NwaCegarLoop]: 4561 mSDtfsCounter, 4827 mSDsluCounter, 13712 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4844 SdHoareTripleChecker+Valid, 18273 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:20,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4844 Valid, 18273 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:19:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65416 states. [2025-01-09 05:19:23,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65416 to 64587. [2025-01-09 05:19:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64587 states, 59422 states have (on average 1.7140957894382551) internal successors, (101855), 61485 states have internal predecessors, (101855), 2329 states have call successors, (2329), 775 states have call predecessors, (2329), 2834 states have return successors, (18711), 2454 states have call predecessors, (18711), 2327 states have call successors, (18711) [2025-01-09 05:19:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64587 states to 64587 states and 122895 transitions. [2025-01-09 05:19:23,559 INFO L78 Accepts]: Start accepts. Automaton has 64587 states and 122895 transitions. Word has length 144 [2025-01-09 05:19:23,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:23,560 INFO L471 AbstractCegarLoop]: Abstraction has 64587 states and 122895 transitions. [2025-01-09 05:19:23,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 64587 states and 122895 transitions. [2025-01-09 05:19:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 05:19:23,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:23,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:23,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:19:23,591 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:23,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:23,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1151355179, now seen corresponding path program 1 times [2025-01-09 05:19:23,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:23,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392514660] [2025-01-09 05:19:23,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:23,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:23,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 05:19:23,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 05:19:23,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:23,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:19:23,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:23,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392514660] [2025-01-09 05:19:23,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392514660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:23,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:23,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:19:23,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556310099] [2025-01-09 05:19:23,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:23,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:19:23,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:23,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:19:23,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:19:23,756 INFO L87 Difference]: Start difference. First operand 64587 states and 122895 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:19:29,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:29,437 INFO L93 Difference]: Finished difference Result 220039 states and 444564 transitions. [2025-01-09 05:19:29,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:19:29,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 144 [2025-01-09 05:19:29,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:30,855 INFO L225 Difference]: With dead ends: 220039 [2025-01-09 05:19:30,856 INFO L226 Difference]: Without dead ends: 157590 [2025-01-09 05:19:30,999 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 05:19:30,999 INFO L435 NwaCegarLoop]: 4551 mSDtfsCounter, 4901 mSDsluCounter, 13679 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4917 SdHoareTripleChecker+Valid, 18230 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:30,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4917 Valid, 18230 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:19:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157590 states.