./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.05.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.05.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7ee209640ee994f311a04b9c2d813fadfd34b19e8b71a748e88ebcbbe5883af1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:18:15,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:18:16,017 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:18:16,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:18:16,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:18:16,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:18:16,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:18:16,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:18:16,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:18:16,053 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:18:16,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:18:16,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:18:16,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:18:16,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:18:16,054 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:18:16,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:18:16,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:18:16,055 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:18:16,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:18:16,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:18:16,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:18:16,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:18:16,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:18:16,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:18:16,055 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:18:16,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:18:16,055 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:18:16,055 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:18:16,055 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:18:16,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:18:16,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:18:16,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:18:16,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:18:16,056 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:18:16,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:18:16,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:18:16,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:18:16,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:18:16,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:18:16,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:18:16,057 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:18:16,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:18:16,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:18:16,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:18:16,057 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:18:16,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:18:16,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:18:16,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:18:16,057 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 -> 7ee209640ee994f311a04b9c2d813fadfd34b19e8b71a748e88ebcbbe5883af1 [2025-01-09 05:18:16,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:18:16,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:18:16,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:18:16,300 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:18:16,300 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:18:16,301 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.05.cil-2.c [2025-01-09 05:18:17,459 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6e81f27c/33cea390c52044cb8b478ae441ef01d8/FLAG06dd8d198 [2025-01-09 05:18:18,116 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:18:18,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.05.cil-2.c [2025-01-09 05:18:18,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6e81f27c/33cea390c52044cb8b478ae441ef01d8/FLAG06dd8d198 [2025-01-09 05:18:18,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6e81f27c/33cea390c52044cb8b478ae441ef01d8 [2025-01-09 05:18:18,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:18:18,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:18:18,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:18:18,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:18:18,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:18:18,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:18:18" (1/1) ... [2025-01-09 05:18:18,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4acd703d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:18, skipping insertion in model container [2025-01-09 05:18:18,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:18:18" (1/1) ... [2025-01-09 05:18:18,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:18:19,740 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.05.cil-2.c[381679,381692] [2025-01-09 05:18:19,775 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.05.cil-2.c[383339,383352] [2025-01-09 05:18:19,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:18:19,980 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:18:20,481 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.05.cil-2.c[381679,381692] [2025-01-09 05:18:20,484 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.05.cil-2.c[383339,383352] [2025-01-09 05:18:20,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:18:20,538 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:18:20,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:20 WrapperNode [2025-01-09 05:18:20,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:18:20,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:18:20,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:18:20,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:18:20,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:20" (1/1) ... [2025-01-09 05:18:20,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:20" (1/1) ... [2025-01-09 05:18:20,931 INFO L138 Inliner]: procedures = 54, calls = 57, calls flagged for inlining = 31, calls inlined = 31, statements flattened = 12792 [2025-01-09 05:18:20,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:18:20,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:18:20,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:18:20,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:18:20,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:20" (1/1) ... [2025-01-09 05:18:20,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:20" (1/1) ... [2025-01-09 05:18:20,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:20" (1/1) ... [2025-01-09 05:18:21,101 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 05:18:21,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:20" (1/1) ... [2025-01-09 05:18:21,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:20" (1/1) ... [2025-01-09 05:18:21,253 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:20" (1/1) ... [2025-01-09 05:18:21,273 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:20" (1/1) ... [2025-01-09 05:18:21,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:20" (1/1) ... [2025-01-09 05:18:21,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:20" (1/1) ... [2025-01-09 05:18:21,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:20" (1/1) ... [2025-01-09 05:18:21,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:18:21,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:18:21,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:18:21,400 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:18:21,401 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:20" (1/1) ... [2025-01-09 05:18:21,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:18:21,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:18:21,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:18:21,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:18:21,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:18:21,458 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:18:21,459 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:18:21,459 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:18:21,459 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:18:21,459 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:18:21,459 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:18:21,459 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 05:18:21,459 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 05:18:21,459 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:18:21,459 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:18:21,459 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:18:21,459 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:18:21,459 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:18:21,459 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:18:21,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:18:21,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:18:21,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:18:21,557 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:18:21,560 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:18:28,007 INFO L? ?]: Removed 1717 outVars from TransFormulas that were not future-live. [2025-01-09 05:18:28,008 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:18:28,101 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:18:28,101 INFO L312 CfgBuilder]: Removed 9 assume(true) statements. [2025-01-09 05:18:28,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:18:28 BoogieIcfgContainer [2025-01-09 05:18:28,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:18:28,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:18:28,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:18:28,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:18:28,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:18:18" (1/3) ... [2025-01-09 05:18:28,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6741085f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:18:28, skipping insertion in model container [2025-01-09 05:18:28,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:18:20" (2/3) ... [2025-01-09 05:18:28,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6741085f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:18:28, skipping insertion in model container [2025-01-09 05:18:28,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:18:28" (3/3) ... [2025-01-09 05:18:28,111 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.05.cil-2.c [2025-01-09 05:18:28,131 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:18:28,136 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.05.cil-2.c that has 8 procedures, 2396 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-01-09 05:18:28,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:18:28,325 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;@34c0cd2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:18:28,325 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:18:28,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 2396 states, 2366 states have (on average 1.849112426035503) internal successors, (4375), 2370 states have internal predecessors, (4375), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 05:18:28,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:18:28,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:28,353 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] [2025-01-09 05:18:28,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:28,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:28,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1308118319, now seen corresponding path program 1 times [2025-01-09 05:18:28,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:28,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970465241] [2025-01-09 05:18:28,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:28,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:28,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:18:28,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:18:28,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:28,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:28,634 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:18:28,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:28,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970465241] [2025-01-09 05:18:28,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970465241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:28,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:28,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:18:28,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015477389] [2025-01-09 05:18:28,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:28,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:18:28,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:28,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:18:28,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:18:28,667 INFO L87 Difference]: Start difference. First operand has 2396 states, 2366 states have (on average 1.849112426035503) internal successors, (4375), 2370 states have internal predecessors, (4375), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:18:28,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:28,820 INFO L93 Difference]: Finished difference Result 4782 states and 8817 transitions. [2025-01-09 05:18:28,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:18:28,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 100 [2025-01-09 05:18:28,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:28,840 INFO L225 Difference]: With dead ends: 4782 [2025-01-09 05:18:28,840 INFO L226 Difference]: Without dead ends: 2328 [2025-01-09 05:18:28,848 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:18:28,850 INFO L435 NwaCegarLoop]: 4343 mSDtfsCounter, 313 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 8365 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:18:28,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 8365 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:18:28,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2025-01-09 05:18:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 2328. [2025-01-09 05:18:28,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2328 states, 2299 states have (on average 1.8421052631578947) internal successors, (4235), 2302 states have internal predecessors, (4235), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 05:18:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 4275 transitions. [2025-01-09 05:18:28,967 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 4275 transitions. Word has length 100 [2025-01-09 05:18:28,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:28,968 INFO L471 AbstractCegarLoop]: Abstraction has 2328 states and 4275 transitions. [2025-01-09 05:18:28,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:18:28,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 4275 transitions. [2025-01-09 05:18:28,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:18:28,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:28,974 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] [2025-01-09 05:18:28,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:18:28,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:28,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:28,975 INFO L85 PathProgramCache]: Analyzing trace with hash -313424621, now seen corresponding path program 1 times [2025-01-09 05:18:28,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:28,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587486365] [2025-01-09 05:18:28,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:28,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:28,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:18:29,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:18:29,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:29,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:29,190 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:18:29,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:29,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587486365] [2025-01-09 05:18:29,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587486365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:29,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:29,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:18:29,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391688937] [2025-01-09 05:18:29,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:29,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:18:29,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:29,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:18:29,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:18:29,192 INFO L87 Difference]: Start difference. First operand 2328 states and 4275 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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:18:29,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:29,603 INFO L93 Difference]: Finished difference Result 2736 states and 4911 transitions. [2025-01-09 05:18:29,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:18:29,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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 100 [2025-01-09 05:18:29,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:29,617 INFO L225 Difference]: With dead ends: 2736 [2025-01-09 05:18:29,618 INFO L226 Difference]: Without dead ends: 2542 [2025-01-09 05:18:29,620 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:18:29,621 INFO L435 NwaCegarLoop]: 4204 mSDtfsCounter, 4525 mSDsluCounter, 8529 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4538 SdHoareTripleChecker+Valid, 12733 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:29,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4538 Valid, 12733 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:18:29,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2025-01-09 05:18:29,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2525. [2025-01-09 05:18:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2525 states, 2475 states have (on average 1.823030303030303) internal successors, (4512), 2479 states have internal predecessors, (4512), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-01-09 05:18:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2525 states and 4581 transitions. [2025-01-09 05:18:29,677 INFO L78 Accepts]: Start accepts. Automaton has 2525 states and 4581 transitions. Word has length 100 [2025-01-09 05:18:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:29,678 INFO L471 AbstractCegarLoop]: Abstraction has 2525 states and 4581 transitions. [2025-01-09 05:18:29,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 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:18:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 4581 transitions. [2025-01-09 05:18:29,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:18:29,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:29,679 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] [2025-01-09 05:18:29,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:18:29,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:29,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:29,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2125043983, now seen corresponding path program 1 times [2025-01-09 05:18:29,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:29,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965656648] [2025-01-09 05:18:29,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:29,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:29,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:18:29,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:18:29,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:29,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:29,821 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:18:29,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:29,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965656648] [2025-01-09 05:18:29,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965656648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:29,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:29,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:29,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653715687] [2025-01-09 05:18:29,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:29,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:29,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:29,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:29,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:29,824 INFO L87 Difference]: Start difference. First operand 2525 states and 4581 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:18:30,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:30,342 INFO L93 Difference]: Finished difference Result 3165 states and 5584 transitions. [2025-01-09 05:18:30,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:30,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 05:18:30,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:30,353 INFO L225 Difference]: With dead ends: 3165 [2025-01-09 05:18:30,353 INFO L226 Difference]: Without dead ends: 2774 [2025-01-09 05:18:30,355 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:18:30,356 INFO L435 NwaCegarLoop]: 4369 mSDtfsCounter, 4520 mSDsluCounter, 13097 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4533 SdHoareTripleChecker+Valid, 17466 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:30,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4533 Valid, 17466 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:18:30,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2025-01-09 05:18:30,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2709. [2025-01-09 05:18:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2709 states, 2638 states have (on average 1.8055344958301744) internal successors, (4763), 2643 states have internal predecessors, (4763), 49 states have call successors, (49), 19 states have call predecessors, (49), 20 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-01-09 05:18:30,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2709 states to 2709 states and 4863 transitions. [2025-01-09 05:18:30,429 INFO L78 Accepts]: Start accepts. Automaton has 2709 states and 4863 transitions. Word has length 100 [2025-01-09 05:18:30,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:30,431 INFO L471 AbstractCegarLoop]: Abstraction has 2709 states and 4863 transitions. [2025-01-09 05:18:30,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:18:30,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2709 states and 4863 transitions. [2025-01-09 05:18:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:18:30,436 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:30,436 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] [2025-01-09 05:18:30,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:18:30,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:30,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:30,437 INFO L85 PathProgramCache]: Analyzing trace with hash -845067119, now seen corresponding path program 1 times [2025-01-09 05:18:30,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:30,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692766113] [2025-01-09 05:18:30,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:30,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:30,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:18:30,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:18:30,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:30,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:30,587 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:18:30,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:30,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692766113] [2025-01-09 05:18:30,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692766113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:30,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:30,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:30,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005369351] [2025-01-09 05:18:30,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:30,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:30,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:30,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:30,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:30,591 INFO L87 Difference]: Start difference. First operand 2709 states and 4863 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:18:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:31,074 INFO L93 Difference]: Finished difference Result 3737 states and 6469 transitions. [2025-01-09 05:18:31,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:31,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 05:18:31,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:31,089 INFO L225 Difference]: With dead ends: 3737 [2025-01-09 05:18:31,089 INFO L226 Difference]: Without dead ends: 3162 [2025-01-09 05:18:31,094 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:18:31,096 INFO L435 NwaCegarLoop]: 4361 mSDtfsCounter, 4512 mSDsluCounter, 13075 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4525 SdHoareTripleChecker+Valid, 17436 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:31,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4525 Valid, 17436 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:18:31,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states. [2025-01-09 05:18:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 3095. [2025-01-09 05:18:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3095 states, 2980 states have (on average 1.7765100671140939) internal successors, (5294), 2989 states have internal predecessors, (5294), 77 states have call successors, (77), 31 states have call predecessors, (77), 36 states have return successors, (91), 78 states have call predecessors, (91), 75 states have call successors, (91) [2025-01-09 05:18:31,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 3095 states and 5462 transitions. [2025-01-09 05:18:31,189 INFO L78 Accepts]: Start accepts. Automaton has 3095 states and 5462 transitions. Word has length 100 [2025-01-09 05:18:31,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:31,189 INFO L471 AbstractCegarLoop]: Abstraction has 3095 states and 5462 transitions. [2025-01-09 05:18:31,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:18:31,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3095 states and 5462 transitions. [2025-01-09 05:18:31,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:18:31,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:31,191 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] [2025-01-09 05:18:31,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:18:31,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:31,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:31,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1902905197, now seen corresponding path program 1 times [2025-01-09 05:18:31,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:31,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333282833] [2025-01-09 05:18:31,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:31,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:31,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:18:31,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:18:31,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:31,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:31,313 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:18:31,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:31,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333282833] [2025-01-09 05:18:31,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333282833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:31,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:31,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:31,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370561300] [2025-01-09 05:18:31,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:31,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:31,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:31,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:31,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:31,315 INFO L87 Difference]: Start difference. First operand 3095 states and 5462 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:18:31,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:31,874 INFO L93 Difference]: Finished difference Result 4959 states and 8398 transitions. [2025-01-09 05:18:31,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:31,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 05:18:31,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:31,889 INFO L225 Difference]: With dead ends: 4959 [2025-01-09 05:18:31,889 INFO L226 Difference]: Without dead ends: 3998 [2025-01-09 05:18:31,893 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:18:31,894 INFO L435 NwaCegarLoop]: 4358 mSDtfsCounter, 4507 mSDsluCounter, 13066 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4520 SdHoareTripleChecker+Valid, 17424 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:31,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4520 Valid, 17424 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:18:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3998 states. [2025-01-09 05:18:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3998 to 3918. [2025-01-09 05:18:32,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3918 states, 3709 states have (on average 1.7357778376921003) internal successors, (6438), 3732 states have internal predecessors, (6438), 133 states have call successors, (133), 55 states have call predecessors, (133), 74 states have return successors, (195), 138 states have call predecessors, (195), 131 states have call successors, (195) [2025-01-09 05:18:32,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 6766 transitions. [2025-01-09 05:18:32,018 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 6766 transitions. Word has length 100 [2025-01-09 05:18:32,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:32,019 INFO L471 AbstractCegarLoop]: Abstraction has 3918 states and 6766 transitions. [2025-01-09 05:18:32,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:18:32,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 6766 transitions. [2025-01-09 05:18:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:18:32,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:32,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:18:32,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:18:32,024 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:32,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:32,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1249559633, now seen corresponding path program 1 times [2025-01-09 05:18:32,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:32,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789316105] [2025-01-09 05:18:32,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:32,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:32,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:18:32,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:18:32,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:32,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:32,145 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:18:32,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:32,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789316105] [2025-01-09 05:18:32,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789316105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:32,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:32,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:32,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708571748] [2025-01-09 05:18:32,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:32,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:32,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:32,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:32,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:32,148 INFO L87 Difference]: Start difference. First operand 3918 states and 6766 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:18:32,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:32,679 INFO L93 Difference]: Finished difference Result 7588 states and 12668 transitions. [2025-01-09 05:18:32,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:32,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 05:18:32,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:32,702 INFO L225 Difference]: With dead ends: 7588 [2025-01-09 05:18:32,703 INFO L226 Difference]: Without dead ends: 5804 [2025-01-09 05:18:32,710 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:18:32,711 INFO L435 NwaCegarLoop]: 4355 mSDtfsCounter, 4502 mSDsluCounter, 13057 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4515 SdHoareTripleChecker+Valid, 17412 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:32,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4515 Valid, 17412 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:18:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5804 states. [2025-01-09 05:18:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5804 to 5699. [2025-01-09 05:18:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5699 states, 5284 states have (on average 1.6915215745647236) internal successors, (8938), 5353 states have internal predecessors, (8938), 245 states have call successors, (245), 103 states have call predecessors, (245), 168 states have return successors, (499), 258 states have call predecessors, (499), 243 states have call successors, (499) [2025-01-09 05:18:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5699 states to 5699 states and 9682 transitions. [2025-01-09 05:18:33,005 INFO L78 Accepts]: Start accepts. Automaton has 5699 states and 9682 transitions. Word has length 100 [2025-01-09 05:18:33,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:33,005 INFO L471 AbstractCegarLoop]: Abstraction has 5699 states and 9682 transitions. [2025-01-09 05:18:33,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:18:33,006 INFO L276 IsEmpty]: Start isEmpty. Operand 5699 states and 9682 transitions. [2025-01-09 05:18:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:18:33,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:33,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:18:33,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:18:33,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:33,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:33,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1489799379, now seen corresponding path program 1 times [2025-01-09 05:18:33,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:33,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232940861] [2025-01-09 05:18:33,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:33,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:33,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:18:33,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:18:33,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:33,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:33,195 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:18:33,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:33,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232940861] [2025-01-09 05:18:33,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232940861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:33,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:33,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:33,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195787112] [2025-01-09 05:18:33,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:33,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:33,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:33,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:33,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:33,200 INFO L87 Difference]: Start difference. First operand 5699 states and 9682 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:18:33,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:33,937 INFO L93 Difference]: Finished difference Result 13967 states and 23383 transitions. [2025-01-09 05:18:33,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:33,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 05:18:33,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:34,065 INFO L225 Difference]: With dead ends: 13967 [2025-01-09 05:18:34,065 INFO L226 Difference]: Without dead ends: 10402 [2025-01-09 05:18:34,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:18:34,075 INFO L435 NwaCegarLoop]: 4211 mSDtfsCounter, 4687 mSDsluCounter, 12715 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4706 SdHoareTripleChecker+Valid, 16926 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:34,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4706 Valid, 16926 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:18:34,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10402 states. [2025-01-09 05:18:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10402 to 9564. [2025-01-09 05:18:34,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9564 states, 8699 states have (on average 1.659731003563628) internal successors, (14438), 8914 states have internal predecessors, (14438), 453 states have call successors, (453), 199 states have call predecessors, (453), 410 states have return successors, (1475), 482 states have call predecessors, (1475), 451 states have call successors, (1475) [2025-01-09 05:18:34,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9564 states to 9564 states and 16366 transitions. [2025-01-09 05:18:34,363 INFO L78 Accepts]: Start accepts. Automaton has 9564 states and 16366 transitions. Word has length 100 [2025-01-09 05:18:34,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:34,364 INFO L471 AbstractCegarLoop]: Abstraction has 9564 states and 16366 transitions. [2025-01-09 05:18:34,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:18:34,364 INFO L276 IsEmpty]: Start isEmpty. Operand 9564 states and 16366 transitions. [2025-01-09 05:18:34,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:18:34,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:34,370 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] [2025-01-09 05:18:34,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:18:34,371 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:34,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:34,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1966134255, now seen corresponding path program 1 times [2025-01-09 05:18:34,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:34,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070074992] [2025-01-09 05:18:34,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:34,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:34,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:18:34,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:18:34,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:34,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:34,456 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:18:34,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:34,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070074992] [2025-01-09 05:18:34,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070074992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:34,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:34,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:34,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885243517] [2025-01-09 05:18:34,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:34,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:34,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:34,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:34,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:34,458 INFO L87 Difference]: Start difference. First operand 9564 states and 16366 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:18:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:35,345 INFO L93 Difference]: Finished difference Result 26914 states and 46997 transitions. [2025-01-09 05:18:35,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:35,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 05:18:35,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:35,422 INFO L225 Difference]: With dead ends: 26914 [2025-01-09 05:18:35,422 INFO L226 Difference]: Without dead ends: 19484 [2025-01-09 05:18:35,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:18:35,476 INFO L435 NwaCegarLoop]: 4346 mSDtfsCounter, 4534 mSDsluCounter, 13025 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4546 SdHoareTripleChecker+Valid, 17371 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:35,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4546 Valid, 17371 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:18:35,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19484 states. [2025-01-09 05:18:36,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19484 to 17849. [2025-01-09 05:18:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17849 states, 15938 states have (on average 1.6402308947170285) internal successors, (26142), 16607 states have internal predecessors, (26142), 853 states have call successors, (853), 391 states have call predecessors, (853), 1056 states have return successors, (4947), 914 states have call predecessors, (4947), 851 states have call successors, (4947) [2025-01-09 05:18:36,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17849 states to 17849 states and 31942 transitions. [2025-01-09 05:18:36,390 INFO L78 Accepts]: Start accepts. Automaton has 17849 states and 31942 transitions. Word has length 100 [2025-01-09 05:18:36,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:36,390 INFO L471 AbstractCegarLoop]: Abstraction has 17849 states and 31942 transitions. [2025-01-09 05:18:36,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:18:36,391 INFO L276 IsEmpty]: Start isEmpty. Operand 17849 states and 31942 transitions. [2025-01-09 05:18:36,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:18:36,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:36,401 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] [2025-01-09 05:18:36,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:18:36,402 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:36,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:36,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1939068653, now seen corresponding path program 1 times [2025-01-09 05:18:36,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:36,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267005443] [2025-01-09 05:18:36,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:36,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:36,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:18:36,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:18:36,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:36,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:36,511 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:18:36,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:36,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267005443] [2025-01-09 05:18:36,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267005443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:36,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:36,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:36,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476794975] [2025-01-09 05:18:36,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:36,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:36,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:36,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:36,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:36,513 INFO L87 Difference]: Start difference. First operand 17849 states and 31942 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:18:38,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:38,004 INFO L93 Difference]: Finished difference Result 54721 states and 103947 transitions. [2025-01-09 05:18:38,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:38,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 05:18:38,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:38,185 INFO L225 Difference]: With dead ends: 54721 [2025-01-09 05:18:38,185 INFO L226 Difference]: Without dead ends: 39006 [2025-01-09 05:18:38,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:18:38,245 INFO L435 NwaCegarLoop]: 4344 mSDtfsCounter, 4591 mSDsluCounter, 13019 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4610 SdHoareTripleChecker+Valid, 17363 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:38,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4610 Valid, 17363 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:18:38,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39006 states. [2025-01-09 05:18:39,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39006 to 36798. [2025-01-09 05:18:39,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36798 states, 32341 states have (on average 1.636127516155963) internal successors, (52914), 34404 states have internal predecessors, (52914), 1621 states have call successors, (1621), 775 states have call predecessors, (1621), 2834 states have return successors, (18003), 1746 states have call predecessors, (18003), 1619 states have call successors, (18003) [2025-01-09 05:18:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36798 states to 36798 states and 72538 transitions. [2025-01-09 05:18:40,080 INFO L78 Accepts]: Start accepts. Automaton has 36798 states and 72538 transitions. Word has length 100 [2025-01-09 05:18:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:40,082 INFO L471 AbstractCegarLoop]: Abstraction has 36798 states and 72538 transitions. [2025-01-09 05:18:40,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:18:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 36798 states and 72538 transitions. [2025-01-09 05:18:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:18:40,100 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:40,100 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] [2025-01-09 05:18:40,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:18:40,100 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:40,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:40,101 INFO L85 PathProgramCache]: Analyzing trace with hash 278561745, now seen corresponding path program 1 times [2025-01-09 05:18:40,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:40,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254453859] [2025-01-09 05:18:40,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:40,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:40,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:18:40,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:18:40,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:40,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:40,203 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:18:40,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:40,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254453859] [2025-01-09 05:18:40,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254453859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:40,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:40,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:18:40,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077386100] [2025-01-09 05:18:40,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:40,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:18:40,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:40,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:18:40,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:18:40,205 INFO L87 Difference]: Start difference. First operand 36798 states and 72538 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:18:43,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:43,235 INFO L93 Difference]: Finished difference Result 117628 states and 257609 transitions. [2025-01-09 05:18:43,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:18:43,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 05:18:43,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:43,898 INFO L225 Difference]: With dead ends: 117628 [2025-01-09 05:18:43,898 INFO L226 Difference]: Without dead ends: 82964 [2025-01-09 05:18:43,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:18:43,978 INFO L435 NwaCegarLoop]: 4341 mSDtfsCounter, 4556 mSDsluCounter, 13010 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4575 SdHoareTripleChecker+Valid, 17351 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:43,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4575 Valid, 17351 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:18:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82964 states. [2025-01-09 05:18:48,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82964 to 79607. [2025-01-09 05:18:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79607 states, 68664 states have (on average 1.63255854596295) internal successors, (112098), 74973 states have internal predecessors, (112098), 3093 states have call successors, (3093), 1543 states have call predecessors, (3093), 7848 states have return successors, (68627), 3346 states have call predecessors, (68627), 3091 states have call successors, (68627) [2025-01-09 05:18:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79607 states to 79607 states and 183818 transitions. [2025-01-09 05:18:49,364 INFO L78 Accepts]: Start accepts. Automaton has 79607 states and 183818 transitions. Word has length 100 [2025-01-09 05:18:49,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:18:49,365 INFO L471 AbstractCegarLoop]: Abstraction has 79607 states and 183818 transitions. [2025-01-09 05:18:49,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 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:18:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 79607 states and 183818 transitions. [2025-01-09 05:18:49,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:18:49,398 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:18:49,398 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] [2025-01-09 05:18:49,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:18:49,398 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:18:49,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:18:49,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2012666195, now seen corresponding path program 1 times [2025-01-09 05:18:49,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:18:49,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277292511] [2025-01-09 05:18:49,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:18:49,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:18:49,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:18:49,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:18:49,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:18:49,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:18:49,489 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:18:49,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:18:49,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277292511] [2025-01-09 05:18:49,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277292511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:18:49,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:18:49,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:18:49,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971436517] [2025-01-09 05:18:49,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:18:49,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:18:49,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:18:49,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:18:49,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:18:49,494 INFO L87 Difference]: Start difference. First operand 79607 states and 183818 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:18:54,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:18:54,167 INFO L93 Difference]: Finished difference Result 170206 states and 436273 transitions. [2025-01-09 05:18:54,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:18:54,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2025-01-09 05:18:54,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:18:54,865 INFO L225 Difference]: With dead ends: 170206 [2025-01-09 05:18:54,865 INFO L226 Difference]: Without dead ends: 92733 [2025-01-09 05:18:55,036 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:18:55,037 INFO L435 NwaCegarLoop]: 4173 mSDtfsCounter, 4356 mSDsluCounter, 8255 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4369 SdHoareTripleChecker+Valid, 12428 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:18:55,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4369 Valid, 12428 Invalid, 284 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [30 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:18:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92733 states. [2025-01-09 05:19:02,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92733 to 79607. [2025-01-09 05:19:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79607 states, 68664 states have (on average 1.628815682162414) internal successors, (111841), 74973 states have internal predecessors, (111841), 3093 states have call successors, (3093), 1543 states have call predecessors, (3093), 7848 states have return successors, (68627), 3346 states have call predecessors, (68627), 3091 states have call successors, (68627) [2025-01-09 05:19:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79607 states to 79607 states and 183561 transitions. [2025-01-09 05:19:02,887 INFO L78 Accepts]: Start accepts. Automaton has 79607 states and 183561 transitions. Word has length 100 [2025-01-09 05:19:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:19:02,888 INFO L471 AbstractCegarLoop]: Abstraction has 79607 states and 183561 transitions. [2025-01-09 05:19:02,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 79607 states and 183561 transitions. [2025-01-09 05:19:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:19:02,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:19:02,917 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] [2025-01-09 05:19:02,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:19:02,917 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:19:02,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:19:02,917 INFO L85 PathProgramCache]: Analyzing trace with hash 101623637, now seen corresponding path program 1 times [2025-01-09 05:19:02,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:19:02,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30787487] [2025-01-09 05:19:02,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:19:02,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:19:02,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:19:02,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:19:02,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:19:02,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:19:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:19:02,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:19:02,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30787487] [2025-01-09 05:19:02,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30787487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:19:02,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:19:02,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:19:02,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680072946] [2025-01-09 05:19:02,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:19:02,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:19:02,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:19:02,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:19:02,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:19:02,963 INFO L87 Difference]: Start difference. First operand 79607 states and 183561 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)