./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.14.cil.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.14.cil.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 42cb47d17200048b14811b4ea8d60759bded6ec8fe8815c3e841b46a3cafae19 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:19:25,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:19:25,860 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:19:25,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:19:25,865 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:19:25,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:19:25,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:19:25,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:19:25,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:19:25,892 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:19:25,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:19:25,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:19:25,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:19:25,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:19:25,893 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:19:25,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:19:25,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:19:25,894 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:19:25,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:19:25,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:19:25,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:19:25,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:19:25,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:19:25,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:19:25,894 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:19:25,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:19:25,895 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:19:25,895 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:19:25,895 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:19:25,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:19:25,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:19:25,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:19:25,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:19:25,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:19:25,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:19:25,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:19:25,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:19:25,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:19:25,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:19:25,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:19:25,896 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:19:25,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:19:25,896 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:19:25,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:19:25,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:19:25,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:19:25,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:19:25,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:19:25,897 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 -> 42cb47d17200048b14811b4ea8d60759bded6ec8fe8815c3e841b46a3cafae19 [2025-01-09 05:19:26,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:19:26,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:19:26,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:19:26,175 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:19:26,176 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:19:26,177 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.14.cil.c [2025-01-09 05:19:27,467 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aefb15c8f/05c162d5e63e4bccaaa652b5410eed31/FLAGc18d5be91 [2025-01-09 05:19:28,281 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:19:28,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.14.cil.c [2025-01-09 05:19:28,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aefb15c8f/05c162d5e63e4bccaaa652b5410eed31/FLAGc18d5be91 [2025-01-09 05:19:28,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aefb15c8f/05c162d5e63e4bccaaa652b5410eed31 [2025-01-09 05:19:28,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:19:28,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:19:28,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:19:28,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:19:28,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:19:28,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:19:28" (1/1) ... [2025-01-09 05:19:28,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c467daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:19:28, skipping insertion in model container [2025-01-09 05:19:28,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:19:28" (1/1) ... [2025-01-09 05:19:28,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:19:30,113 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.14.cil.c[381679,381692] [2025-01-09 05:19:30,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.14.cil.c[383339,383352] [2025-01-09 05:19:30,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:19:30,578 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:19:31,206 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.14.cil.c[381679,381692] [2025-01-09 05:19:31,212 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.14.cil.c[383339,383352] [2025-01-09 05:19:31,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:19:31,320 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:19:31,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:19:31 WrapperNode [2025-01-09 05:19:31,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:19:31,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:19:31,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:19:31,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:19:31,330 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:19:31" (1/1) ... [2025-01-09 05:19:31,428 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:19:31" (1/1) ... [2025-01-09 05:19:31,879 INFO L138 Inliner]: procedures = 68, calls = 78, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 13189 [2025-01-09 05:19:31,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:19:31,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:19:31,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:19:31,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:19:31,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:19:31" (1/1) ... [2025-01-09 05:19:31,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:19:31" (1/1) ... [2025-01-09 05:19:31,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:19:31" (1/1) ... [2025-01-09 05:19:32,086 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:19:32,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:19:31" (1/1) ... [2025-01-09 05:19:32,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:19:31" (1/1) ... [2025-01-09 05:19:32,212 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:19:31" (1/1) ... [2025-01-09 05:19:32,233 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:19:31" (1/1) ... [2025-01-09 05:19:32,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:19:31" (1/1) ... [2025-01-09 05:19:32,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:19:31" (1/1) ... [2025-01-09 05:19:32,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:19:31" (1/1) ... [2025-01-09 05:19:32,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:19:32,423 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:19:32,423 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:19:32,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:19:32,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:19:31" (1/1) ... [2025-01-09 05:19:32,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:19:32,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:19:32,455 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:19:32,458 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:19:32,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:19:32,481 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:19:32,482 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:19:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:19:32,482 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:19:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:19:32,482 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:19:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 05:19:32,482 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 05:19:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:19:32,482 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:19:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:19:32,482 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:19:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:19:32,482 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:19:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:19:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:19:32,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:19:32,636 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:19:32,639 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:19:40,497 INFO L? ?]: Removed 1759 outVars from TransFormulas that were not future-live. [2025-01-09 05:19:40,498 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:19:40,575 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:19:40,576 INFO L312 CfgBuilder]: Removed 16 assume(true) statements. [2025-01-09 05:19:40,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:19:40 BoogieIcfgContainer [2025-01-09 05:19:40,576 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:19:40,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:19:40,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:19:40,583 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:19:40,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:19:28" (1/3) ... [2025-01-09 05:19:40,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edbd44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:19:40, skipping insertion in model container [2025-01-09 05:19:40,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:19:31" (2/3) ... [2025-01-09 05:19:40,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edbd44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:19:40, skipping insertion in model container [2025-01-09 05:19:40,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:19:40" (3/3) ... [2025-01-09 05:19:40,587 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.14.cil.c [2025-01-09 05:19:40,601 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:19:40,606 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.14.cil.c that has 8 procedures, 2569 locations, 1 initial locations, 16 loop locations, and 2 error locations. [2025-01-09 05:19:40,730 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:19:40,743 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;@1a938cdd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:19:40,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:19:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 2569 states, 2532 states have (on average 1.8368878357030016) internal successors, (4651), 2536 states have internal predecessors, (4651), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 05:19:40,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 05:19:40,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:40,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:40,781 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:40,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:40,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1163724122, now seen corresponding path program 1 times [2025-01-09 05:19:40,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:40,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473565391] [2025-01-09 05:19:40,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:40,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:40,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 05:19:40,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 05:19:40,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:40,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:41,216 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:41,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:41,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473565391] [2025-01-09 05:19:41,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473565391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:41,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:41,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:19:41,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866811746] [2025-01-09 05:19:41,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:41,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:19:41,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:41,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:19:41,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:19:41,251 INFO L87 Difference]: Start difference. First operand has 2569 states, 2532 states have (on average 1.8368878357030016) internal successors, (4651), 2536 states have internal predecessors, (4651), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (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:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:41,462 INFO L93 Difference]: Finished difference Result 5130 states and 9401 transitions. [2025-01-09 05:19:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:19:41,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (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 177 [2025-01-09 05:19:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:41,488 INFO L225 Difference]: With dead ends: 5130 [2025-01-09 05:19:41,488 INFO L226 Difference]: Without dead ends: 2501 [2025-01-09 05:19:41,501 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:41,504 INFO L435 NwaCegarLoop]: 4626 mSDtfsCounter, 598 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 8648 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:41,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 8648 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:41,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2025-01-09 05:19:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 2501. [2025-01-09 05:19:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2465 states have (on average 1.8271805273833672) internal successors, (4504), 2468 states have internal predecessors, (4504), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 05:19:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 4558 transitions. [2025-01-09 05:19:41,679 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 4558 transitions. Word has length 177 [2025-01-09 05:19:41,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:41,680 INFO L471 AbstractCegarLoop]: Abstraction has 2501 states and 4558 transitions. [2025-01-09 05:19:41,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (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:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 4558 transitions. [2025-01-09 05:19:41,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 05:19:41,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:41,687 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:41,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:19:41,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:41,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:41,688 INFO L85 PathProgramCache]: Analyzing trace with hash 244001828, now seen corresponding path program 1 times [2025-01-09 05:19:41,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:41,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13211644] [2025-01-09 05:19:41,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:41,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:41,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 05:19:41,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 05:19:41,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:41,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:41,865 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:41,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:41,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13211644] [2025-01-09 05:19:41,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13211644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:41,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:41,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:19:41,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614132663] [2025-01-09 05:19:41,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:41,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:19:41,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:41,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:19:41,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:19:41,870 INFO L87 Difference]: Start difference. First operand 2501 states and 4558 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (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:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:41,959 INFO L93 Difference]: Finished difference Result 2865 states and 5131 transitions. [2025-01-09 05:19:41,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:19:41,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (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 177 [2025-01-09 05:19:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:41,975 INFO L225 Difference]: With dead ends: 2865 [2025-01-09 05:19:41,976 INFO L226 Difference]: Without dead ends: 2501 [2025-01-09 05:19:41,978 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:41,979 INFO L435 NwaCegarLoop]: 4556 mSDtfsCounter, 584 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 8514 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:41,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 8514 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:41,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2025-01-09 05:19:42,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 2501. [2025-01-09 05:19:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2465 states have (on average 1.8267748478701826) internal successors, (4503), 2468 states have internal predecessors, (4503), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 05:19:42,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 4557 transitions. [2025-01-09 05:19:42,059 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 4557 transitions. Word has length 177 [2025-01-09 05:19:42,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:42,060 INFO L471 AbstractCegarLoop]: Abstraction has 2501 states and 4557 transitions. [2025-01-09 05:19:42,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (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:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 4557 transitions. [2025-01-09 05:19:42,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 05:19:42,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:42,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:42,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:19:42,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:42,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:42,065 INFO L85 PathProgramCache]: Analyzing trace with hash -423380062, now seen corresponding path program 1 times [2025-01-09 05:19:42,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:42,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667108257] [2025-01-09 05:19:42,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:42,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:42,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 05:19:42,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 05:19:42,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:42,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:42,398 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:42,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:42,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667108257] [2025-01-09 05:19:42,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667108257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:42,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:42,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:19:42,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804337910] [2025-01-09 05:19:42,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:42,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:19:42,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:42,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:19:42,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:19:42,401 INFO L87 Difference]: Start difference. First operand 2501 states and 4557 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 2 states have call successors, (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:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:43,308 INFO L93 Difference]: Finished difference Result 3269 states and 5787 transitions. [2025-01-09 05:19:43,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:19:43,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 2 states have call successors, (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 177 [2025-01-09 05:19:43,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:43,326 INFO L225 Difference]: With dead ends: 3269 [2025-01-09 05:19:43,326 INFO L226 Difference]: Without dead ends: 2909 [2025-01-09 05:19:43,330 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:43,331 INFO L435 NwaCegarLoop]: 4423 mSDtfsCounter, 5115 mSDsluCounter, 9103 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5135 SdHoareTripleChecker+Valid, 13526 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:43,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5135 Valid, 13526 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:19:43,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2025-01-09 05:19:43,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2878. [2025-01-09 05:19:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2878 states, 2814 states have (on average 1.7992181947405828) internal successors, (5063), 2818 states have internal predecessors, (5063), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-01-09 05:19:43,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 5160 transitions. [2025-01-09 05:19:43,436 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 5160 transitions. Word has length 177 [2025-01-09 05:19:43,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:43,436 INFO L471 AbstractCegarLoop]: Abstraction has 2878 states and 5160 transitions. [2025-01-09 05:19:43,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 2 states have call successors, (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:43,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 5160 transitions. [2025-01-09 05:19:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 05:19:43,439 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:43,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:43,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:19:43,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:43,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:43,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1210930334, now seen corresponding path program 1 times [2025-01-09 05:19:43,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:43,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168408931] [2025-01-09 05:19:43,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:43,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:43,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 05:19:43,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 05:19:43,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:43,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:43,772 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:43,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:43,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168408931] [2025-01-09 05:19:43,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168408931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:43,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:43,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:19:43,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140374869] [2025-01-09 05:19:43,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:43,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:19:43,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:43,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:19:43,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:19:43,777 INFO L87 Difference]: Start difference. First operand 2878 states and 5160 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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:44,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:44,837 INFO L93 Difference]: Finished difference Result 4100 states and 7138 transitions. [2025-01-09 05:19:44,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:19:44,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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 177 [2025-01-09 05:19:44,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:44,859 INFO L225 Difference]: With dead ends: 4100 [2025-01-09 05:19:44,859 INFO L226 Difference]: Without dead ends: 3363 [2025-01-09 05:19:44,864 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:44,867 INFO L435 NwaCegarLoop]: 4745 mSDtfsCounter, 5124 mSDsluCounter, 14284 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5144 SdHoareTripleChecker+Valid, 19029 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:44,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5144 Valid, 19029 Invalid, 1131 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:19:44,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2025-01-09 05:19:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 3228. [2025-01-09 05:19:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3228 states, 3136 states have (on average 1.775829081632653) internal successors, (5569), 3141 states have internal predecessors, (5569), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (72), 69 states have call predecessors, (72), 68 states have call successors, (72) [2025-01-09 05:19:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3228 states to 3228 states and 5711 transitions. [2025-01-09 05:19:44,994 INFO L78 Accepts]: Start accepts. Automaton has 3228 states and 5711 transitions. Word has length 177 [2025-01-09 05:19:44,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:44,995 INFO L471 AbstractCegarLoop]: Abstraction has 3228 states and 5711 transitions. [2025-01-09 05:19:44,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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:44,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3228 states and 5711 transitions. [2025-01-09 05:19:44,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 05:19:44,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:44,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:44,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:19:44,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:44,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:45,000 INFO L85 PathProgramCache]: Analyzing trace with hash -194261344, now seen corresponding path program 1 times [2025-01-09 05:19:45,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:45,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664903368] [2025-01-09 05:19:45,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:45,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:45,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 05:19:45,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 05:19:45,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:45,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:45,250 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:45,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:45,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664903368] [2025-01-09 05:19:45,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664903368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:45,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:45,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:19:45,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728993382] [2025-01-09 05:19:45,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:45,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:19:45,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:45,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:19:45,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:19:45,253 INFO L87 Difference]: Start difference. First operand 3228 states and 5711 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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:46,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:46,211 INFO L93 Difference]: Finished difference Result 5220 states and 8930 transitions. [2025-01-09 05:19:46,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:19:46,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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 177 [2025-01-09 05:19:46,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:46,236 INFO L225 Difference]: With dead ends: 5220 [2025-01-09 05:19:46,237 INFO L226 Difference]: Without dead ends: 4133 [2025-01-09 05:19:46,243 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:46,244 INFO L435 NwaCegarLoop]: 4465 mSDtfsCounter, 5152 mSDsluCounter, 13615 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5172 SdHoareTripleChecker+Valid, 18080 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:46,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5172 Valid, 18080 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:19:46,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4133 states. [2025-01-09 05:19:46,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4133 to 3977. [2025-01-09 05:19:46,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3977 states, 3827 states have (on average 1.743402142670499) internal successors, (6672), 3836 states have internal predecessors, (6672), 112 states have call successors, (112), 31 states have call predecessors, (112), 36 states have return successors, (126), 113 states have call predecessors, (126), 110 states have call successors, (126) [2025-01-09 05:19:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3977 states to 3977 states and 6910 transitions. [2025-01-09 05:19:46,416 INFO L78 Accepts]: Start accepts. Automaton has 3977 states and 6910 transitions. Word has length 177 [2025-01-09 05:19:46,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:46,417 INFO L471 AbstractCegarLoop]: Abstraction has 3977 states and 6910 transitions. [2025-01-09 05:19:46,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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:46,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3977 states and 6910 transitions. [2025-01-09 05:19:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 05:19:46,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:46,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:46,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:19:46,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:46,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:46,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1700072542, now seen corresponding path program 1 times [2025-01-09 05:19:46,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:46,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297173] [2025-01-09 05:19:46,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:46,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:46,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 05:19:46,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 05:19:46,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:46,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:46,626 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:46,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:46,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297173] [2025-01-09 05:19:46,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:46,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:46,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:19:46,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526158401] [2025-01-09 05:19:46,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:46,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:19:46,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:46,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:19:46,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:19:46,629 INFO L87 Difference]: Start difference. First operand 3977 states and 6910 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:47,625 INFO L93 Difference]: Finished difference Result 7651 states and 12899 transitions. [2025-01-09 05:19:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:19:47,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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 177 [2025-01-09 05:19:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:47,656 INFO L225 Difference]: With dead ends: 7651 [2025-01-09 05:19:47,656 INFO L226 Difference]: Without dead ends: 5815 [2025-01-09 05:19:47,664 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:47,665 INFO L435 NwaCegarLoop]: 4738 mSDtfsCounter, 5114 mSDsluCounter, 14263 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5134 SdHoareTripleChecker+Valid, 19001 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:47,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5134 Valid, 19001 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:19:47,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5815 states. [2025-01-09 05:19:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5815 to 5616. [2025-01-09 05:19:47,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5616 states, 5344 states have (on average 1.7103293413173652) internal successors, (9140), 5367 states have internal predecessors, (9140), 196 states have call successors, (196), 55 states have call predecessors, (196), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-01-09 05:19:47,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5616 states to 5616 states and 9594 transitions. [2025-01-09 05:19:47,885 INFO L78 Accepts]: Start accepts. Automaton has 5616 states and 9594 transitions. Word has length 177 [2025-01-09 05:19:47,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:47,886 INFO L471 AbstractCegarLoop]: Abstraction has 5616 states and 9594 transitions. [2025-01-09 05:19:47,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 5616 states and 9594 transitions. [2025-01-09 05:19:47,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 05:19:47,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:47,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:47,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:19:47,891 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:47,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:47,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1148313888, now seen corresponding path program 1 times [2025-01-09 05:19:47,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:47,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024394092] [2025-01-09 05:19:47,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:47,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:47,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 05:19:47,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 05:19:47,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:47,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:48,082 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:48,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:48,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024394092] [2025-01-09 05:19:48,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024394092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:48,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:48,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:19:48,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534209494] [2025-01-09 05:19:48,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:48,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:19:48,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:48,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:19:48,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:19:48,086 INFO L87 Difference]: Start difference. First operand 5616 states and 9594 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:49,069 INFO L93 Difference]: Finished difference Result 13020 states and 21893 transitions. [2025-01-09 05:19:49,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:19:49,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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 177 [2025-01-09 05:19:49,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:49,116 INFO L225 Difference]: With dead ends: 13020 [2025-01-09 05:19:49,116 INFO L226 Difference]: Without dead ends: 9545 [2025-01-09 05:19:49,132 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:49,133 INFO L435 NwaCegarLoop]: 4731 mSDtfsCounter, 5106 mSDsluCounter, 14244 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5126 SdHoareTripleChecker+Valid, 18975 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:49,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5126 Valid, 18975 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:19:49,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9545 states. [2025-01-09 05:19:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9545 to 9272. [2025-01-09 05:19:49,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9272 states, 8738 states have (on average 1.690775921263447) internal successors, (14774), 8807 states have internal predecessors, (14774), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-01-09 05:19:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9272 states to 9272 states and 15756 transitions. [2025-01-09 05:19:49,445 INFO L78 Accepts]: Start accepts. Automaton has 9272 states and 15756 transitions. Word has length 177 [2025-01-09 05:19:49,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:49,446 INFO L471 AbstractCegarLoop]: Abstraction has 9272 states and 15756 transitions. [2025-01-09 05:19:49,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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:49,447 INFO L276 IsEmpty]: Start isEmpty. Operand 9272 states and 15756 transitions. [2025-01-09 05:19:49,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 05:19:49,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:49,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:49,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:19:49,453 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:49,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:49,454 INFO L85 PathProgramCache]: Analyzing trace with hash -762451486, now seen corresponding path program 1 times [2025-01-09 05:19:49,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:49,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343410565] [2025-01-09 05:19:49,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:49,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:49,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 05:19:49,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 05:19:49,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:49,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:19:49,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:49,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343410565] [2025-01-09 05:19:49,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343410565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:49,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:49,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:19:49,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49830966] [2025-01-09 05:19:49,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:49,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:19:49,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:49,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:19:49,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:19:49,652 INFO L87 Difference]: Start difference. First operand 9272 states and 15756 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:50,921 INFO L93 Difference]: Finished difference Result 25252 states and 43121 transitions. [2025-01-09 05:19:50,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:19:50,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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 177 [2025-01-09 05:19:50,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:51,007 INFO L225 Difference]: With dead ends: 25252 [2025-01-09 05:19:51,008 INFO L226 Difference]: Without dead ends: 18121 [2025-01-09 05:19:51,043 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:51,043 INFO L435 NwaCegarLoop]: 4728 mSDtfsCounter, 5101 mSDsluCounter, 14235 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5121 SdHoareTripleChecker+Valid, 18963 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:51,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5121 Valid, 18963 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 05:19:51,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18121 states. [2025-01-09 05:19:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18121 to 17691. [2025-01-09 05:19:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17691 states, 16579 states have (on average 1.6940708124736112) internal successors, (28086), 16794 states have internal predecessors, (28086), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-01-09 05:19:51,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17691 states to 17691 states and 30508 transitions. [2025-01-09 05:19:51,795 INFO L78 Accepts]: Start accepts. Automaton has 17691 states and 30508 transitions. Word has length 177 [2025-01-09 05:19:51,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:51,795 INFO L471 AbstractCegarLoop]: Abstraction has 17691 states and 30508 transitions. [2025-01-09 05:19:51,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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:51,797 INFO L276 IsEmpty]: Start isEmpty. Operand 17691 states and 30508 transitions. [2025-01-09 05:19:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 05:19:51,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:51,806 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:51,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:19:51,807 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:51,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:51,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1027098976, now seen corresponding path program 1 times [2025-01-09 05:19:51,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:51,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040933345] [2025-01-09 05:19:51,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:51,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:51,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 05:19:51,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 05:19:51,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:51,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:51,979 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:51,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:51,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040933345] [2025-01-09 05:19:51,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040933345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:51,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:51,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:19:51,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684483506] [2025-01-09 05:19:51,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:51,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:19:51,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:51,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:19:51,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:19:51,982 INFO L87 Difference]: Start difference. First operand 17691 states and 30508 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:52,776 INFO L93 Difference]: Finished difference Result 38141 states and 67182 transitions. [2025-01-09 05:19:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:19:52,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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 177 [2025-01-09 05:19:52,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:52,873 INFO L225 Difference]: With dead ends: 38141 [2025-01-09 05:19:52,873 INFO L226 Difference]: Without dead ends: 22591 [2025-01-09 05:19:52,937 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:52,938 INFO L435 NwaCegarLoop]: 4400 mSDtfsCounter, 4770 mSDsluCounter, 8641 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4790 SdHoareTripleChecker+Valid, 13041 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:52,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4790 Valid, 13041 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:19:52,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22591 states. [2025-01-09 05:19:54,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22591 to 17691. [2025-01-09 05:19:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17691 states, 16579 states have (on average 1.692080342602087) internal successors, (28053), 16794 states have internal predecessors, (28053), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-01-09 05:19:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17691 states to 17691 states and 30475 transitions. [2025-01-09 05:19:54,137 INFO L78 Accepts]: Start accepts. Automaton has 17691 states and 30475 transitions. Word has length 177 [2025-01-09 05:19:54,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:54,137 INFO L471 AbstractCegarLoop]: Abstraction has 17691 states and 30475 transitions. [2025-01-09 05:19:54,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 17691 states and 30475 transitions. [2025-01-09 05:19:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 05:19:54,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:54,150 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:54,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:19:54,150 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:54,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:54,151 INFO L85 PathProgramCache]: Analyzing trace with hash 904026658, now seen corresponding path program 1 times [2025-01-09 05:19:54,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:54,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958990988] [2025-01-09 05:19:54,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:54,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:54,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 05:19:54,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 05:19:54,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:54,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:54,411 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:54,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:54,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958990988] [2025-01-09 05:19:54,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958990988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:54,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:54,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:19:54,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709310495] [2025-01-09 05:19:54,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:54,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:19:54,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:54,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:19:54,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:19:54,413 INFO L87 Difference]: Start difference. First operand 17691 states and 30475 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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:56,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:19:56,027 INFO L93 Difference]: Finished difference Result 53691 states and 94676 transitions. [2025-01-09 05:19:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:19:56,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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 177 [2025-01-09 05:19:56,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:19:56,183 INFO L225 Difference]: With dead ends: 53691 [2025-01-09 05:19:56,183 INFO L226 Difference]: Without dead ends: 38141 [2025-01-09 05:19:56,224 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:56,225 INFO L435 NwaCegarLoop]: 4720 mSDtfsCounter, 5088 mSDsluCounter, 14212 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5108 SdHoareTripleChecker+Valid, 18932 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:19:56,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5108 Valid, 18932 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:19:56,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38141 states. [2025-01-09 05:19:57,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38141 to 37445. [2025-01-09 05:19:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37445 states, 35015 states have (on average 1.712837355419106) internal successors, (59975), 35684 states have internal predecessors, (59975), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-01-09 05:19:57,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37445 states to 37445 states and 66813 transitions. [2025-01-09 05:19:57,635 INFO L78 Accepts]: Start accepts. Automaton has 37445 states and 66813 transitions. Word has length 177 [2025-01-09 05:19:57,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:57,636 INFO L471 AbstractCegarLoop]: Abstraction has 37445 states and 66813 transitions. [2025-01-09 05:19:57,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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:57,636 INFO L276 IsEmpty]: Start isEmpty. Operand 37445 states and 66813 transitions. [2025-01-09 05:19:57,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 05:19:57,650 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:57,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:19:57,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:19:57,651 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:57,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:57,652 INFO L85 PathProgramCache]: Analyzing trace with hash -419152288, now seen corresponding path program 1 times [2025-01-09 05:19:57,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:57,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274266230] [2025-01-09 05:19:57,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:57,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:57,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 05:19:57,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 05:19:57,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:57,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:57,961 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:57,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:57,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274266230] [2025-01-09 05:19:57,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274266230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:57,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:57,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:19:57,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750903759] [2025-01-09 05:19:57,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:57,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:19:57,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:57,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:19:57,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:19:57,963 INFO L87 Difference]: Start difference. First operand 37445 states and 66813 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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:20:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:20:01,113 INFO L93 Difference]: Finished difference Result 121999 states and 226436 transitions. [2025-01-09 05:20:01,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:20:01,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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 177 [2025-01-09 05:20:01,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:20:01,751 INFO L225 Difference]: With dead ends: 121999 [2025-01-09 05:20:01,752 INFO L226 Difference]: Without dead ends: 86695 [2025-01-09 05:20:01,856 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:20:01,857 INFO L435 NwaCegarLoop]: 4717 mSDtfsCounter, 5083 mSDsluCounter, 14203 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5103 SdHoareTripleChecker+Valid, 18920 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:20:01,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5103 Valid, 18920 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:20:01,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86695 states. [2025-01-09 05:20:04,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86695 to 85458. [2025-01-09 05:20:04,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85458 states, 79906 states have (on average 1.7437864490776662) internal successors, (139339), 81969 states have internal predecessors, (139339), 2716 states have call successors, (2716), 775 states have call predecessors, (2716), 2834 states have return successors, (19098), 2841 states have call predecessors, (19098), 2714 states have call successors, (19098) [2025-01-09 05:20:05,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85458 states to 85458 states and 161153 transitions. [2025-01-09 05:20:05,491 INFO L78 Accepts]: Start accepts. Automaton has 85458 states and 161153 transitions. Word has length 177 [2025-01-09 05:20:05,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:20:05,493 INFO L471 AbstractCegarLoop]: Abstraction has 85458 states and 161153 transitions. [2025-01-09 05:20:05,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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:20:05,493 INFO L276 IsEmpty]: Start isEmpty. Operand 85458 states and 161153 transitions. [2025-01-09 05:20:05,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 05:20:05,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:20:05,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:20:05,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:20:05,525 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:20:05,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:20:05,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1477827170, now seen corresponding path program 1 times [2025-01-09 05:20:05,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:20:05,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698818719] [2025-01-09 05:20:05,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:20:05,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:20:05,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 05:20:05,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 05:20:05,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:20:05,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:20:05,684 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:20:05,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:20:05,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698818719] [2025-01-09 05:20:05,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698818719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:20:05,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:20:05,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:20:05,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95003382] [2025-01-09 05:20:05,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:20:05,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:20:05,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:20:05,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:20:05,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:20:05,689 INFO L87 Difference]: Start difference. First operand 85458 states and 161153 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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:20:11,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:20:11,298 INFO L93 Difference]: Finished difference Result 291116 states and 579750 transitions. [2025-01-09 05:20:11,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:20:11,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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 177 [2025-01-09 05:20:11,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:20:12,720 INFO L225 Difference]: With dead ends: 291116 [2025-01-09 05:20:12,720 INFO L226 Difference]: Without dead ends: 207799 [2025-01-09 05:20:13,046 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:20:13,047 INFO L435 NwaCegarLoop]: 4448 mSDtfsCounter, 5123 mSDsluCounter, 13563 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5143 SdHoareTripleChecker+Valid, 18011 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:20:13,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5143 Valid, 18011 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:20:13,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207799 states. [2025-01-09 05:20:23,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207799 to 205541. [2025-01-09 05:20:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205541 states, 192287 states have (on average 1.77725483261999) internal successors, (341743), 198596 states have internal predecessors, (341743), 5404 states have call successors, (5404), 1543 states have call predecessors, (5404), 7848 states have return successors, (70938), 5657 states have call predecessors, (70938), 5402 states have call successors, (70938) [2025-01-09 05:20:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205541 states to 205541 states and 418085 transitions. [2025-01-09 05:20:25,293 INFO L78 Accepts]: Start accepts. Automaton has 205541 states and 418085 transitions. Word has length 177 [2025-01-09 05:20:25,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:20:25,293 INFO L471 AbstractCegarLoop]: Abstraction has 205541 states and 418085 transitions. [2025-01-09 05:20:25,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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:20:25,293 INFO L276 IsEmpty]: Start isEmpty. Operand 205541 states and 418085 transitions. [2025-01-09 05:20:25,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 05:20:25,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:20:25,336 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:20:25,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:20:25,336 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:20:25,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:20:25,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1816114720, now seen corresponding path program 1 times [2025-01-09 05:20:25,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:20:25,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137646406] [2025-01-09 05:20:25,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:20:25,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:20:25,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 05:20:25,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 05:20:25,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:20:25,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:20:25,797 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:20:25,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:20:25,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137646406] [2025-01-09 05:20:25,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137646406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:20:25,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:20:25,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:20:25,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030691768] [2025-01-09 05:20:25,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:20:25,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:20:25,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:20:25,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:20:25,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:20:25,802 INFO L87 Difference]: Start difference. First operand 205541 states and 418085 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (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)