./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.08.cil-1.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_label49+token_ring.08.cil-1.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 cc9459d71a43b78b6be6f61a2c5766a75503f0e4a415faec33f88f27c796c833 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:27:47,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:27:48,038 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:27:48,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:27:48,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:27:48,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:27:48,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:27:48,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:27:48,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:27:48,068 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:27:48,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:27:48,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:27:48,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:27:48,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:27:48,069 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:27:48,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:27:48,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:27:48,070 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:27:48,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:27:48,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:27:48,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:27:48,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:27:48,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:27:48,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:27:48,070 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:27:48,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:27:48,071 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:27:48,071 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:27:48,071 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:27:48,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:27:48,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:27:48,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:27:48,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:27:48,071 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:27:48,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:27:48,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:27:48,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:27:48,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:27:48,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:27:48,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:27:48,071 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:27:48,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:27:48,071 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:27:48,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:27:48,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:27:48,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:27:48,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:27:48,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:27:48,072 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 -> cc9459d71a43b78b6be6f61a2c5766a75503f0e4a415faec33f88f27c796c833 [2025-01-09 05:27:48,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:27:48,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:27:48,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:27:48,311 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:27:48,311 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:27:48,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.08.cil-1.c [2025-01-09 05:27:49,525 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08ef56da8/a6f3a4a78b324d27b6a6eb13f002130b/FLAG82c112b43 [2025-01-09 05:27:50,179 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:27:50,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.08.cil-1.c [2025-01-09 05:27:50,223 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08ef56da8/a6f3a4a78b324d27b6a6eb13f002130b/FLAG82c112b43 [2025-01-09 05:27:50,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08ef56da8/a6f3a4a78b324d27b6a6eb13f002130b [2025-01-09 05:27:50,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:27:50,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:27:50,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:27:50,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:27:50,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:27:50,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:27:50" (1/1) ... [2025-01-09 05:27:50,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb21166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:50, skipping insertion in model container [2025-01-09 05:27:50,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:27:50" (1/1) ... [2025-01-09 05:27:50,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:27:51,867 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_label49+token_ring.08.cil-1.c[380593,380606] [2025-01-09 05:27:51,893 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_label49+token_ring.08.cil-1.c[383339,383352] [2025-01-09 05:27:52,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:27:52,116 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:27:52,791 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_label49+token_ring.08.cil-1.c[380593,380606] [2025-01-09 05:27:52,796 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_label49+token_ring.08.cil-1.c[383339,383352] [2025-01-09 05:27:52,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:27:52,871 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:27:52,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:52 WrapperNode [2025-01-09 05:27:52,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:27:52,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:27:52,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:27:52,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:27:52,878 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:27:52" (1/1) ... [2025-01-09 05:27:52,928 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:27:52" (1/1) ... [2025-01-09 05:27:53,303 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12957 [2025-01-09 05:27:53,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:27:53,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:27:53,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:27:53,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:27:53,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:52" (1/1) ... [2025-01-09 05:27:53,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:52" (1/1) ... [2025-01-09 05:27:53,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:52" (1/1) ... [2025-01-09 05:27:53,478 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:27:53,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:52" (1/1) ... [2025-01-09 05:27:53,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:52" (1/1) ... [2025-01-09 05:27:53,630 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:52" (1/1) ... [2025-01-09 05:27:53,650 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:52" (1/1) ... [2025-01-09 05:27:53,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:52" (1/1) ... [2025-01-09 05:27:53,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:52" (1/1) ... [2025-01-09 05:27:53,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:52" (1/1) ... [2025-01-09 05:27:53,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:27:53,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:27:53,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:27:53,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:27:53,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:52" (1/1) ... [2025-01-09 05:27:53,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:27:53,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:27:53,867 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:27:53,873 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:27:53,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:27:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:27:53,890 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:27:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:27:53,890 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:27:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:27:53,890 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:27:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:27:53,890 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:27:53,890 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:27:53,891 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:27:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:27:53,891 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:27:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:27:53,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:27:53,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:27:54,001 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:27:54,002 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:28:00,385 INFO L? ?]: Removed 1731 outVars from TransFormulas that were not future-live. [2025-01-09 05:28:00,385 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:28:00,422 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:28:00,422 INFO L312 CfgBuilder]: Removed 12 assume(true) statements. [2025-01-09 05:28:00,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:28:00 BoogieIcfgContainer [2025-01-09 05:28:00,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:28:00,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:28:00,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:28:00,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:28:00,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:27:50" (1/3) ... [2025-01-09 05:28:00,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a34b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:28:00, skipping insertion in model container [2025-01-09 05:28:00,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:27:52" (2/3) ... [2025-01-09 05:28:00,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a34b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:28:00, skipping insertion in model container [2025-01-09 05:28:00,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:28:00" (3/3) ... [2025-01-09 05:28:00,433 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.08.cil-1.c [2025-01-09 05:28:00,444 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:28:00,448 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.08.cil-1.c that has 7 procedures, 2463 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-01-09 05:28:00,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:28:00,555 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;@a026691, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:28:00,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:28:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 2463 states, 2433 states have (on average 1.843403205918619) internal successors, (4485), 2435 states have internal predecessors, (4485), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 05:28:00,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:28:00,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:00,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:00,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:00,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:00,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1300921813, now seen corresponding path program 1 times [2025-01-09 05:28:00,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:00,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57381870] [2025-01-09 05:28:00,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:00,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:00,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:28:00,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:28:00,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:00,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:01,028 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:28:01,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:01,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57381870] [2025-01-09 05:28:01,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57381870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:01,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:01,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:28:01,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271031833] [2025-01-09 05:28:01,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:01,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:28:01,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:01,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:28:01,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:28:01,054 INFO L87 Difference]: Start difference. First operand has 2463 states, 2433 states have (on average 1.843403205918619) internal successors, (4485), 2435 states have internal predecessors, (4485), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:01,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:01,281 INFO L93 Difference]: Finished difference Result 4919 states and 9045 transitions. [2025-01-09 05:28:01,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:28:01,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-01-09 05:28:01,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:01,308 INFO L225 Difference]: With dead ends: 4919 [2025-01-09 05:28:01,309 INFO L226 Difference]: Without dead ends: 2396 [2025-01-09 05:28:01,320 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:28:01,323 INFO L435 NwaCegarLoop]: 4454 mSDtfsCounter, 426 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 8476 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:01,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 8476 Invalid, 2 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:28:01,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2025-01-09 05:28:01,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 2396. [2025-01-09 05:28:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 2366 states have (on average 1.835164835164835) internal successors, (4342), 2368 states have internal predecessors, (4342), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 05:28:01,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 4386 transitions. [2025-01-09 05:28:01,449 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 4386 transitions. Word has length 132 [2025-01-09 05:28:01,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:01,451 INFO L471 AbstractCegarLoop]: Abstraction has 2396 states and 4386 transitions. [2025-01-09 05:28:01,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 4386 transitions. [2025-01-09 05:28:01,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:28:01,460 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:01,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:01,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:28:01,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:01,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:01,461 INFO L85 PathProgramCache]: Analyzing trace with hash 749487085, now seen corresponding path program 1 times [2025-01-09 05:28:01,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:01,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624123858] [2025-01-09 05:28:01,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:01,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:01,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:28:01,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:28:01,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:01,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:01,719 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:28:01,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:01,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624123858] [2025-01-09 05:28:01,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624123858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:01,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:01,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:28:01,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861147735] [2025-01-09 05:28:01,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:01,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:28:01,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:01,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:28:01,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:28:01,721 INFO L87 Difference]: Start difference. First operand 2396 states and 4386 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:02,251 INFO L93 Difference]: Finished difference Result 2946 states and 5256 transitions. [2025-01-09 05:28:02,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:28:02,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-01-09 05:28:02,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:02,264 INFO L225 Difference]: With dead ends: 2946 [2025-01-09 05:28:02,265 INFO L226 Difference]: Without dead ends: 2687 [2025-01-09 05:28:02,267 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:28:02,267 INFO L435 NwaCegarLoop]: 4289 mSDtfsCounter, 4766 mSDsluCounter, 8752 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4782 SdHoareTripleChecker+Valid, 13041 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:02,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4782 Valid, 13041 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:28:02,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2025-01-09 05:28:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2666. [2025-01-09 05:28:02,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2666 states, 2612 states have (on average 1.8116385911179174) internal successors, (4732), 2615 states have internal predecessors, (4732), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-01-09 05:28:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 4811 transitions. [2025-01-09 05:28:02,326 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 4811 transitions. Word has length 132 [2025-01-09 05:28:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:02,326 INFO L471 AbstractCegarLoop]: Abstraction has 2666 states and 4811 transitions. [2025-01-09 05:28:02,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:02,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4811 transitions. [2025-01-09 05:28:02,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:28:02,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:02,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:02,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:28:02,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:02,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:02,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1632626545, now seen corresponding path program 1 times [2025-01-09 05:28:02,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:02,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136380238] [2025-01-09 05:28:02,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:02,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:02,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:28:02,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:28:02,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:02,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:02,509 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:28:02,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:02,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136380238] [2025-01-09 05:28:02,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136380238] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:02,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:02,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:02,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890475140] [2025-01-09 05:28:02,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:02,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:02,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:02,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:02,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:02,511 INFO L87 Difference]: Start difference. First operand 2666 states and 4811 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:03,349 INFO L93 Difference]: Finished difference Result 3539 states and 6203 transitions. [2025-01-09 05:28:03,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:03,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-01-09 05:28:03,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:03,360 INFO L225 Difference]: With dead ends: 3539 [2025-01-09 05:28:03,361 INFO L226 Difference]: Without dead ends: 3010 [2025-01-09 05:28:03,362 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:28:03,363 INFO L435 NwaCegarLoop]: 4512 mSDtfsCounter, 4768 mSDsluCounter, 13554 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4784 SdHoareTripleChecker+Valid, 18066 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:03,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4784 Valid, 18066 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:28:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2025-01-09 05:28:03,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 2917. [2025-01-09 05:28:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2917 states, 2839 states have (on average 1.790771398379711) internal successors, (5084), 2843 states have internal predecessors, (5084), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-01-09 05:28:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 5200 transitions. [2025-01-09 05:28:03,422 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 5200 transitions. Word has length 132 [2025-01-09 05:28:03,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:03,422 INFO L471 AbstractCegarLoop]: Abstraction has 2917 states and 5200 transitions. [2025-01-09 05:28:03,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:03,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 5200 transitions. [2025-01-09 05:28:03,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:28:03,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:03,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:03,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:28:03,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:03,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:03,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2103982895, now seen corresponding path program 1 times [2025-01-09 05:28:03,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:03,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179814098] [2025-01-09 05:28:03,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:03,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:03,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:28:03,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:28:03,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:03,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:03,640 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:28:03,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:03,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179814098] [2025-01-09 05:28:03,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179814098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:03,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:03,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:03,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010005902] [2025-01-09 05:28:03,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:03,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:03,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:03,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:03,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:03,641 INFO L87 Difference]: Start difference. First operand 2917 states and 5200 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:04,158 INFO L93 Difference]: Finished difference Result 4338 states and 7461 transitions. [2025-01-09 05:28:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:04,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-01-09 05:28:04,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:04,171 INFO L225 Difference]: With dead ends: 4338 [2025-01-09 05:28:04,172 INFO L226 Difference]: Without dead ends: 3558 [2025-01-09 05:28:04,175 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:28:04,176 INFO L435 NwaCegarLoop]: 4315 mSDtfsCounter, 4787 mSDsluCounter, 13088 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4803 SdHoareTripleChecker+Valid, 17403 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:04,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4803 Valid, 17403 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:28:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2025-01-09 05:28:04,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3452. [2025-01-09 05:28:04,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3324 states have (on average 1.7590252707581226) internal successors, (5847), 3332 states have internal predecessors, (5847), 90 states have call successors, (90), 30 states have call predecessors, (90), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-01-09 05:28:04,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 6043 transitions. [2025-01-09 05:28:04,262 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 6043 transitions. Word has length 132 [2025-01-09 05:28:04,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:04,262 INFO L471 AbstractCegarLoop]: Abstraction has 3452 states and 6043 transitions. [2025-01-09 05:28:04,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:04,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 6043 transitions. [2025-01-09 05:28:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:28:04,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:04,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:04,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:28:04,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:04,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:04,266 INFO L85 PathProgramCache]: Analyzing trace with hash 456619953, now seen corresponding path program 1 times [2025-01-09 05:28:04,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:04,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248139676] [2025-01-09 05:28:04,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:04,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:04,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:28:04,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:28:04,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:04,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:04,393 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:28:04,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:04,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248139676] [2025-01-09 05:28:04,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248139676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:04,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:04,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:04,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067470611] [2025-01-09 05:28:04,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:04,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:04,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:04,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:04,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:04,395 INFO L87 Difference]: Start difference. First operand 3452 states and 6043 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:05,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:05,014 INFO L93 Difference]: Finished difference Result 6063 states and 10234 transitions. [2025-01-09 05:28:05,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:05,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-01-09 05:28:05,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:05,034 INFO L225 Difference]: With dead ends: 6063 [2025-01-09 05:28:05,034 INFO L226 Difference]: Without dead ends: 4748 [2025-01-09 05:28:05,039 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:28:05,041 INFO L435 NwaCegarLoop]: 4505 mSDtfsCounter, 4758 mSDsluCounter, 13533 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4774 SdHoareTripleChecker+Valid, 18038 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:05,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4774 Valid, 18038 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:28:05,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2025-01-09 05:28:05,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 4615. [2025-01-09 05:28:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4615 states, 4381 states have (on average 1.7208399908696645) internal successors, (7539), 4403 states have internal predecessors, (7539), 158 states have call successors, (158), 54 states have call predecessors, (158), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-01-09 05:28:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4615 states to 4615 states and 7919 transitions. [2025-01-09 05:28:05,182 INFO L78 Accepts]: Start accepts. Automaton has 4615 states and 7919 transitions. Word has length 132 [2025-01-09 05:28:05,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:05,183 INFO L471 AbstractCegarLoop]: Abstraction has 4615 states and 7919 transitions. [2025-01-09 05:28:05,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:05,183 INFO L276 IsEmpty]: Start isEmpty. Operand 4615 states and 7919 transitions. [2025-01-09 05:28:05,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:28:05,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:05,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:05,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:28:05,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:05,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:05,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1674730769, now seen corresponding path program 1 times [2025-01-09 05:28:05,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:05,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625737700] [2025-01-09 05:28:05,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:05,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:05,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:28:05,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:28:05,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:05,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:05,303 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:28:05,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:05,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625737700] [2025-01-09 05:28:05,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625737700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:05,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:05,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:05,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529540931] [2025-01-09 05:28:05,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:05,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:05,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:05,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:05,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:05,304 INFO L87 Difference]: Start difference. First operand 4615 states and 7919 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:05,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:05,982 INFO L93 Difference]: Finished difference Result 9828 states and 16452 transitions. [2025-01-09 05:28:05,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:05,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-01-09 05:28:05,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:06,008 INFO L225 Difference]: With dead ends: 9828 [2025-01-09 05:28:06,009 INFO L226 Difference]: Without dead ends: 7350 [2025-01-09 05:28:06,016 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:28:06,017 INFO L435 NwaCegarLoop]: 4498 mSDtfsCounter, 4750 mSDsluCounter, 13514 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4766 SdHoareTripleChecker+Valid, 18012 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:06,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4766 Valid, 18012 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:28:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7350 states. [2025-01-09 05:28:06,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7350 to 7175. [2025-01-09 05:28:06,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7175 states, 6711 states have (on average 1.688720011920727) internal successors, (11333), 6779 states have internal predecessors, (11333), 294 states have call successors, (294), 102 states have call predecessors, (294), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-01-09 05:28:06,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7175 states to 7175 states and 12177 transitions. [2025-01-09 05:28:06,205 INFO L78 Accepts]: Start accepts. Automaton has 7175 states and 12177 transitions. Word has length 132 [2025-01-09 05:28:06,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:06,205 INFO L471 AbstractCegarLoop]: Abstraction has 7175 states and 12177 transitions. [2025-01-09 05:28:06,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:06,206 INFO L276 IsEmpty]: Start isEmpty. Operand 7175 states and 12177 transitions. [2025-01-09 05:28:06,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:28:06,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:06,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:06,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:28:06,209 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:06,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:06,210 INFO L85 PathProgramCache]: Analyzing trace with hash 647071149, now seen corresponding path program 1 times [2025-01-09 05:28:06,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:06,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991572182] [2025-01-09 05:28:06,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:06,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:06,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:28:06,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:28:06,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:06,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:06,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:28:06,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:06,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991572182] [2025-01-09 05:28:06,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991572182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:06,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:06,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:06,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566840246] [2025-01-09 05:28:06,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:06,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:06,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:06,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:06,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:06,315 INFO L87 Difference]: Start difference. First operand 7175 states and 12177 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:07,304 INFO L93 Difference]: Finished difference Result 18276 states and 30976 transitions. [2025-01-09 05:28:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:07,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-01-09 05:28:07,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:07,361 INFO L225 Difference]: With dead ends: 18276 [2025-01-09 05:28:07,361 INFO L226 Difference]: Without dead ends: 13238 [2025-01-09 05:28:07,382 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:28:07,383 INFO L435 NwaCegarLoop]: 4495 mSDtfsCounter, 4745 mSDsluCounter, 13505 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4761 SdHoareTripleChecker+Valid, 18000 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:07,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4761 Valid, 18000 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:28:07,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13238 states. [2025-01-09 05:28:07,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13238 to 12970. [2025-01-09 05:28:07,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12970 states, 11992 states have (on average 1.676200800533689) internal successors, (20101), 12206 states have internal predecessors, (20101), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-01-09 05:28:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12970 states to 12970 states and 22257 transitions. [2025-01-09 05:28:07,883 INFO L78 Accepts]: Start accepts. Automaton has 12970 states and 22257 transitions. Word has length 132 [2025-01-09 05:28:07,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:07,883 INFO L471 AbstractCegarLoop]: Abstraction has 12970 states and 22257 transitions. [2025-01-09 05:28:07,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:07,888 INFO L276 IsEmpty]: Start isEmpty. Operand 12970 states and 22257 transitions. [2025-01-09 05:28:07,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:28:07,894 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:07,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:07,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:28:07,895 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:07,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1494789329, now seen corresponding path program 1 times [2025-01-09 05:28:07,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:07,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523996938] [2025-01-09 05:28:07,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:07,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:07,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:28:07,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:28:07,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:07,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:08,012 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:28:08,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:08,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523996938] [2025-01-09 05:28:08,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523996938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:08,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:08,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:28:08,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726625543] [2025-01-09 05:28:08,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:08,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:28:08,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:08,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:28:08,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:28:08,018 INFO L87 Difference]: Start difference. First operand 12970 states and 22257 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:08,573 INFO L93 Difference]: Finished difference Result 26743 states and 46767 transitions. [2025-01-09 05:28:08,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:28:08,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-01-09 05:28:08,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:08,630 INFO L225 Difference]: With dead ends: 26743 [2025-01-09 05:28:08,630 INFO L226 Difference]: Without dead ends: 15910 [2025-01-09 05:28:08,665 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:28:08,665 INFO L435 NwaCegarLoop]: 4266 mSDtfsCounter, 4526 mSDsluCounter, 8417 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4542 SdHoareTripleChecker+Valid, 12683 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:08,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4542 Valid, 12683 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:28:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15910 states. [2025-01-09 05:28:09,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15910 to 12970. [2025-01-09 05:28:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12970 states, 11992 states have (on average 1.6734489659773182) internal successors, (20068), 12206 states have internal predecessors, (20068), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-01-09 05:28:09,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12970 states to 12970 states and 22224 transitions. [2025-01-09 05:28:09,661 INFO L78 Accepts]: Start accepts. Automaton has 12970 states and 22224 transitions. Word has length 132 [2025-01-09 05:28:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:09,661 INFO L471 AbstractCegarLoop]: Abstraction has 12970 states and 22224 transitions. [2025-01-09 05:28:09,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 12970 states and 22224 transitions. [2025-01-09 05:28:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:28:09,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:09,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:09,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:28:09,675 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:09,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:09,679 INFO L85 PathProgramCache]: Analyzing trace with hash -2118070931, now seen corresponding path program 1 times [2025-01-09 05:28:09,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:09,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598932794] [2025-01-09 05:28:09,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:09,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:09,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:28:09,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:28:09,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:09,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:09,902 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:28:09,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:09,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598932794] [2025-01-09 05:28:09,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598932794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:09,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:09,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:09,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515036945] [2025-01-09 05:28:09,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:09,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:09,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:09,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:09,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:09,904 INFO L87 Difference]: Start difference. First operand 12970 states and 22224 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:11,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:11,031 INFO L93 Difference]: Finished difference Result 37419 states and 65667 transitions. [2025-01-09 05:28:11,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:11,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-01-09 05:28:11,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:11,126 INFO L225 Difference]: With dead ends: 37419 [2025-01-09 05:28:11,126 INFO L226 Difference]: Without dead ends: 26586 [2025-01-09 05:28:11,155 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:28:11,158 INFO L435 NwaCegarLoop]: 4487 mSDtfsCounter, 4732 mSDsluCounter, 13482 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4748 SdHoareTripleChecker+Valid, 17969 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:11,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4748 Valid, 17969 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:28:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26586 states. [2025-01-09 05:28:12,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26586 to 26180. [2025-01-09 05:28:12,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26180 states, 24012 states have (on average 1.678743961352657) internal successors, (40310), 24680 states have internal predecessors, (40310), 1110 states have call successors, (1110), 390 states have call predecessors, (1110), 1056 states have return successors, (5206), 1173 states have call predecessors, (5206), 1110 states have call successors, (5206) [2025-01-09 05:28:12,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26180 states to 26180 states and 46626 transitions. [2025-01-09 05:28:12,316 INFO L78 Accepts]: Start accepts. Automaton has 26180 states and 46626 transitions. Word has length 132 [2025-01-09 05:28:12,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:12,316 INFO L471 AbstractCegarLoop]: Abstraction has 26180 states and 46626 transitions. [2025-01-09 05:28:12,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:12,316 INFO L276 IsEmpty]: Start isEmpty. Operand 26180 states and 46626 transitions. [2025-01-09 05:28:12,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:28:12,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:12,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:12,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:28:12,326 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:12,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:12,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1999629457, now seen corresponding path program 1 times [2025-01-09 05:28:12,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:12,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131835287] [2025-01-09 05:28:12,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:12,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:12,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:28:12,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:28:12,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:12,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:12,435 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:28:12,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:12,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131835287] [2025-01-09 05:28:12,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131835287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:12,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:12,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:12,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993385823] [2025-01-09 05:28:12,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:12,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:12,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:12,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:12,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:12,437 INFO L87 Difference]: Start difference. First operand 26180 states and 46626 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:14,761 INFO L93 Difference]: Finished difference Result 85855 states and 159284 transitions. [2025-01-09 05:28:14,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:14,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-01-09 05:28:14,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:15,036 INFO L225 Difference]: With dead ends: 85855 [2025-01-09 05:28:15,037 INFO L226 Difference]: Without dead ends: 61812 [2025-01-09 05:28:15,097 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:28:15,098 INFO L435 NwaCegarLoop]: 4482 mSDtfsCounter, 4981 mSDsluCounter, 13462 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5006 SdHoareTripleChecker+Valid, 17944 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:15,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5006 Valid, 17944 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:28:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61812 states. [2025-01-09 05:28:17,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61812 to 57025. [2025-01-09 05:28:17,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57025 states, 52055 states have (on average 1.698395927384497) internal successors, (88410), 54117 states have internal predecessors, (88410), 2134 states have call successors, (2134), 774 states have call predecessors, (2134), 2834 states have return successors, (18518), 2261 states have call predecessors, (18518), 2134 states have call successors, (18518) [2025-01-09 05:28:17,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57025 states to 57025 states and 109062 transitions. [2025-01-09 05:28:17,631 INFO L78 Accepts]: Start accepts. Automaton has 57025 states and 109062 transitions. Word has length 132 [2025-01-09 05:28:17,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:17,632 INFO L471 AbstractCegarLoop]: Abstraction has 57025 states and 109062 transitions. [2025-01-09 05:28:17,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 57025 states and 109062 transitions. [2025-01-09 05:28:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:28:17,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:17,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:17,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:28:17,651 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:17,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:17,652 INFO L85 PathProgramCache]: Analyzing trace with hash -610335443, now seen corresponding path program 1 times [2025-01-09 05:28:17,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:17,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536384070] [2025-01-09 05:28:17,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:17,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:17,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:28:17,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:28:17,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:17,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:17,784 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:28:17,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:17,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536384070] [2025-01-09 05:28:17,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536384070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:17,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:17,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:17,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457639941] [2025-01-09 05:28:17,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:17,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:17,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:17,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:17,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:17,786 INFO L87 Difference]: Start difference. First operand 57025 states and 109062 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:22,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:22,703 INFO L93 Difference]: Finished difference Result 194172 states and 397014 transitions. [2025-01-09 05:28:22,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:22,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-01-09 05:28:22,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:23,633 INFO L225 Difference]: With dead ends: 194172 [2025-01-09 05:28:23,634 INFO L226 Difference]: Without dead ends: 139284 [2025-01-09 05:28:23,913 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:28:23,914 INFO L435 NwaCegarLoop]: 4315 mSDtfsCounter, 4829 mSDsluCounter, 13054 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4844 SdHoareTripleChecker+Valid, 17369 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:23,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4844 Valid, 17369 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:28:24,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139284 states. [2025-01-09 05:28:30,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139284 to 130404. [2025-01-09 05:28:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130404 states, 118436 states have (on average 1.7218919922996385) internal successors, (203934), 124744 states have internal predecessors, (203934), 4118 states have call successors, (4118), 1542 states have call predecessors, (4118), 7848 states have return successors, (69654), 4373 states have call predecessors, (69654), 4118 states have call successors, (69654) [2025-01-09 05:28:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130404 states to 130404 states and 277706 transitions. [2025-01-09 05:28:31,941 INFO L78 Accepts]: Start accepts. Automaton has 130404 states and 277706 transitions. Word has length 132 [2025-01-09 05:28:31,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:31,942 INFO L471 AbstractCegarLoop]: Abstraction has 130404 states and 277706 transitions. [2025-01-09 05:28:31,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 130404 states and 277706 transitions. [2025-01-09 05:28:31,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:28:31,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:31,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:31,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:28:31,969 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:31,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:31,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1651237807, now seen corresponding path program 1 times [2025-01-09 05:28:31,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:31,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705395367] [2025-01-09 05:28:31,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:31,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:31,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:28:31,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:28:31,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:31,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:28:32,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:32,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705395367] [2025-01-09 05:28:32,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705395367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:32,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:32,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:32,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687161852] [2025-01-09 05:28:32,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:32,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:32,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:32,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:32,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:32,057 INFO L87 Difference]: Start difference. First operand 130404 states and 277706 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)