./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label44+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_label44+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 a50787eee309f695181bc37c4f84940bb8fed2cb76457a2c563ef0feb29ebac8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:20:11,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:20:11,788 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:20:11,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:20:11,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:20:11,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:20:11,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:20:11,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:20:11,806 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:20:11,806 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:20:11,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:20:11,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:20:11,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:20:11,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:20:11,806 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:20:11,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:20:11,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:20:11,806 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:20:11,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:20:11,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:20:11,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:20:11,807 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:20:11,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:20:11,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:20:11,807 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:20:11,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:20:11,807 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:20:11,807 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:20:11,807 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:20:11,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:20:11,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:20:11,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:20:11,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:20:11,807 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:20:11,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:20:11,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:20:11,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:20:11,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:20:11,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:20:11,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:20:11,808 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:20:11,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:20:11,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:20:11,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:20:11,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:20:11,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:20:11,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:20:11,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:20:11,808 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 -> a50787eee309f695181bc37c4f84940bb8fed2cb76457a2c563ef0feb29ebac8 [2025-01-09 05:20:12,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:20:12,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:20:12,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:20:12,051 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:20:12,051 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:20:12,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label44+token_ring.08.cil-1.c [2025-01-09 05:20:13,176 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7fe1bbf2/33068600c0684acaa88524312a5f24e1/FLAGf9a454138 [2025-01-09 05:20:13,777 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:20:13,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.08.cil-1.c [2025-01-09 05:20:13,819 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7fe1bbf2/33068600c0684acaa88524312a5f24e1/FLAGf9a454138 [2025-01-09 05:20:14,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7fe1bbf2/33068600c0684acaa88524312a5f24e1 [2025-01-09 05:20:14,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:20:14,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:20:14,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:20:14,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:20:14,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:20:14,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:20:14" (1/1) ... [2025-01-09 05:20:14,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e94e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:14, skipping insertion in model container [2025-01-09 05:20:14,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:20:14" (1/1) ... [2025-01-09 05:20:14,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:20:15,494 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_label44+token_ring.08.cil-1.c[377340,377353] [2025-01-09 05:20:15,523 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_label44+token_ring.08.cil-1.c[383339,383352] [2025-01-09 05:20:15,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:20:15,736 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:20:16,249 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_label44+token_ring.08.cil-1.c[377340,377353] [2025-01-09 05:20:16,255 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_label44+token_ring.08.cil-1.c[383339,383352] [2025-01-09 05:20:16,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:20:16,320 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:20:16,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:16 WrapperNode [2025-01-09 05:20:16,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:20:16,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:20:16,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:20:16,324 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:20:16,328 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:20:16" (1/1) ... [2025-01-09 05:20:16,385 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:20:16" (1/1) ... [2025-01-09 05:20:16,661 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12957 [2025-01-09 05:20:16,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:20:16,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:20:16,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:20:16,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:20:16,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:16" (1/1) ... [2025-01-09 05:20:16,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:16" (1/1) ... [2025-01-09 05:20:16,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:16" (1/1) ... [2025-01-09 05:20:16,873 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:20:16,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:16" (1/1) ... [2025-01-09 05:20:16,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:16" (1/1) ... [2025-01-09 05:20:17,000 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:16" (1/1) ... [2025-01-09 05:20:17,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:16" (1/1) ... [2025-01-09 05:20:17,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:16" (1/1) ... [2025-01-09 05:20:17,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:16" (1/1) ... [2025-01-09 05:20:17,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:16" (1/1) ... [2025-01-09 05:20:17,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:20:17,155 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:20:17,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:20:17,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:20:17,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:16" (1/1) ... [2025-01-09 05:20:17,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:20:17,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:20:17,179 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:20:17,182 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:20:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:20:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:20:17,197 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:20:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:20:17,197 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:20:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:20:17,197 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:20:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:20:17,197 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:20:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:20:17,198 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:20:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:20:17,198 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:20:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:20:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:20:17,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:20:17,294 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:20:17,295 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:20:23,200 INFO L? ?]: Removed 1731 outVars from TransFormulas that were not future-live. [2025-01-09 05:20:23,201 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:20:23,255 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:20:23,256 INFO L312 CfgBuilder]: Removed 12 assume(true) statements. [2025-01-09 05:20:23,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:20:23 BoogieIcfgContainer [2025-01-09 05:20:23,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:20:23,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:20:23,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:20:23,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:20:23,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:20:14" (1/3) ... [2025-01-09 05:20:23,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14564673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:20:23, skipping insertion in model container [2025-01-09 05:20:23,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:16" (2/3) ... [2025-01-09 05:20:23,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14564673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:20:23, skipping insertion in model container [2025-01-09 05:20:23,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:20:23" (3/3) ... [2025-01-09 05:20:23,266 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label44+token_ring.08.cil-1.c [2025-01-09 05:20:23,275 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:20:23,278 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label44+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:20:23,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:20:23,358 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;@557b0ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:20:23,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:20:23,367 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:20:23,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:20:23,383 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:20:23,384 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:20:23,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:20:23,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:20:23,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1300921813, now seen corresponding path program 1 times [2025-01-09 05:20:23,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:20:23,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83354906] [2025-01-09 05:20:23,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:20:23,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:20:23,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:20:23,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:20:23,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:20:23,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:20:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:20:23,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:20:23,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83354906] [2025-01-09 05:20:23,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83354906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:20:23,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:20:23,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:20:23,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448527851] [2025-01-09 05:20:23,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:20:23,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:20:23,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:20:23,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:20:23,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:20:23,692 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:20:23,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:20:23,833 INFO L93 Difference]: Finished difference Result 4919 states and 9045 transitions. [2025-01-09 05:20:23,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:20:23,835 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:20:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:20:23,860 INFO L225 Difference]: With dead ends: 4919 [2025-01-09 05:20:23,860 INFO L226 Difference]: Without dead ends: 2396 [2025-01-09 05:20:23,872 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:20:23,876 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.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:20:23,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 8476 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:20:23,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2025-01-09 05:20:24,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 2396. [2025-01-09 05:20:24,027 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:20:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 4386 transitions. [2025-01-09 05:20:24,042 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 4386 transitions. Word has length 132 [2025-01-09 05:20:24,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:20:24,044 INFO L471 AbstractCegarLoop]: Abstraction has 2396 states and 4386 transitions. [2025-01-09 05:20:24,044 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:20:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 4386 transitions. [2025-01-09 05:20:24,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:20:24,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:20:24,049 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:20:24,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:20:24,050 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:20:24,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:20:24,050 INFO L85 PathProgramCache]: Analyzing trace with hash 749487085, now seen corresponding path program 1 times [2025-01-09 05:20:24,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:20:24,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080127584] [2025-01-09 05:20:24,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:20:24,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:20:24,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:20:24,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:20:24,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:20:24,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:20:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:20:24,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:20:24,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080127584] [2025-01-09 05:20:24,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080127584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:20:24,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:20:24,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:20:24,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211024752] [2025-01-09 05:20:24,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:20:24,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:20:24,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:20:24,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:20:24,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:20:24,271 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:20:24,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:20:24,768 INFO L93 Difference]: Finished difference Result 2946 states and 5256 transitions. [2025-01-09 05:20:24,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:20:24,768 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:20:24,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:20:24,780 INFO L225 Difference]: With dead ends: 2946 [2025-01-09 05:20:24,781 INFO L226 Difference]: Without dead ends: 2687 [2025-01-09 05:20:24,783 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:20:24,783 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:20:24,784 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:20:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2025-01-09 05:20:24,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2666. [2025-01-09 05:20:24,834 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:20:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 4811 transitions. [2025-01-09 05:20:24,845 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 4811 transitions. Word has length 132 [2025-01-09 05:20:24,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:20:24,846 INFO L471 AbstractCegarLoop]: Abstraction has 2666 states and 4811 transitions. [2025-01-09 05:20:24,847 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:20:24,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4811 transitions. [2025-01-09 05:20:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:20:24,850 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:20:24,851 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:20:24,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:20:24,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:20:24,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:20:24,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1632626545, now seen corresponding path program 1 times [2025-01-09 05:20:24,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:20:24,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718115141] [2025-01-09 05:20:24,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:20:24,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:20:24,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:20:24,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:20:24,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:20:24,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:20:25,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:20:25,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:20:25,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718115141] [2025-01-09 05:20:25,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718115141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:20:25,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:20:25,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:20:25,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236514951] [2025-01-09 05:20:25,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:20:25,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:20:25,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:20:25,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:20:25,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:20:25,059 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:20:25,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:20:25,640 INFO L93 Difference]: Finished difference Result 3539 states and 6203 transitions. [2025-01-09 05:20:25,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:20:25,641 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:20:25,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:20:25,656 INFO L225 Difference]: With dead ends: 3539 [2025-01-09 05:20:25,656 INFO L226 Difference]: Without dead ends: 3010 [2025-01-09 05:20:25,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:20:25,660 INFO L435 NwaCegarLoop]: 4512 mSDtfsCounter, 4768 mSDsluCounter, 13554 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:20:25,661 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.5s Time] [2025-01-09 05:20:25,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2025-01-09 05:20:25,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 2917. [2025-01-09 05:20:25,725 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:20:25,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 5200 transitions. [2025-01-09 05:20:25,738 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 5200 transitions. Word has length 132 [2025-01-09 05:20:25,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:20:25,738 INFO L471 AbstractCegarLoop]: Abstraction has 2917 states and 5200 transitions. [2025-01-09 05:20:25,738 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:20:25,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 5200 transitions. [2025-01-09 05:20:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:20:25,740 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:20:25,740 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:20:25,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:20:25,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:20:25,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:20:25,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2103982895, now seen corresponding path program 1 times [2025-01-09 05:20:25,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:20:25,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190784796] [2025-01-09 05:20:25,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:20:25,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:20:25,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:20:25,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:20:25,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:20:25,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:20:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:20:25,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:20:25,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190784796] [2025-01-09 05:20:25,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190784796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:20:25,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:20:25,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:20:25,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954212511] [2025-01-09 05:20:25,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:20:25,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:20:25,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:20:25,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:20:25,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:20:25,893 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:20:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:20:26,468 INFO L93 Difference]: Finished difference Result 4338 states and 7461 transitions. [2025-01-09 05:20:26,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:20:26,469 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:20:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:20:26,486 INFO L225 Difference]: With dead ends: 4338 [2025-01-09 05:20:26,486 INFO L226 Difference]: Without dead ends: 3558 [2025-01-09 05:20:26,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:20:26,491 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:20:26,492 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:20:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2025-01-09 05:20:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3452. [2025-01-09 05:20:26,582 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:20:26,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 6043 transitions. [2025-01-09 05:20:26,597 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 6043 transitions. Word has length 132 [2025-01-09 05:20:26,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:20:26,597 INFO L471 AbstractCegarLoop]: Abstraction has 3452 states and 6043 transitions. [2025-01-09 05:20:26,598 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:20:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 6043 transitions. [2025-01-09 05:20:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:20:26,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:20:26,600 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:20:26,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:20:26,601 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:20:26,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:20:26,601 INFO L85 PathProgramCache]: Analyzing trace with hash 456619953, now seen corresponding path program 1 times [2025-01-09 05:20:26,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:20:26,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812133586] [2025-01-09 05:20:26,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:20:26,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:20:26,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:20:26,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:20:26,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:20:26,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:20:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:20:26,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:20:26,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812133586] [2025-01-09 05:20:26,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812133586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:20:26,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:20:26,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:20:26,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439421181] [2025-01-09 05:20:26,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:20:26,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:20:26,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:20:26,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:20:26,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:20:26,756 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:20:27,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:20:27,409 INFO L93 Difference]: Finished difference Result 6063 states and 10234 transitions. [2025-01-09 05:20:27,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:20:27,410 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:20:27,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:20:27,432 INFO L225 Difference]: With dead ends: 6063 [2025-01-09 05:20:27,433 INFO L226 Difference]: Without dead ends: 4748 [2025-01-09 05:20:27,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:20:27,440 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:20:27,440 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:20:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2025-01-09 05:20:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 4615. [2025-01-09 05:20:27,602 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:20:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4615 states to 4615 states and 7919 transitions. [2025-01-09 05:20:27,620 INFO L78 Accepts]: Start accepts. Automaton has 4615 states and 7919 transitions. Word has length 132 [2025-01-09 05:20:27,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:20:27,620 INFO L471 AbstractCegarLoop]: Abstraction has 4615 states and 7919 transitions. [2025-01-09 05:20:27,621 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:20:27,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4615 states and 7919 transitions. [2025-01-09 05:20:27,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:20:27,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:20:27,624 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:20:27,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:20:27,624 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:20:27,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:20:27,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1674730769, now seen corresponding path program 1 times [2025-01-09 05:20:27,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:20:27,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226746090] [2025-01-09 05:20:27,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:20:27,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:20:27,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:20:27,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:20:27,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:20:27,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:20:27,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:20:27,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:20:27,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226746090] [2025-01-09 05:20:27,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226746090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:20:27,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:20:27,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:20:27,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614764270] [2025-01-09 05:20:27,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:20:27,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:20:27,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:20:27,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:20:27,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:20:27,773 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:20:28,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:20:28,456 INFO L93 Difference]: Finished difference Result 9828 states and 16452 transitions. [2025-01-09 05:20:28,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:20:28,457 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:20:28,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:20:28,485 INFO L225 Difference]: With dead ends: 9828 [2025-01-09 05:20:28,485 INFO L226 Difference]: Without dead ends: 7350 [2025-01-09 05:20:28,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:20:28,495 INFO L435 NwaCegarLoop]: 4498 mSDtfsCounter, 4750 mSDsluCounter, 13514 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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:20:28,495 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:20:28,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7350 states. [2025-01-09 05:20:28,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7350 to 7175. [2025-01-09 05:20:28,650 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:20:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7175 states to 7175 states and 12177 transitions. [2025-01-09 05:20:28,671 INFO L78 Accepts]: Start accepts. Automaton has 7175 states and 12177 transitions. Word has length 132 [2025-01-09 05:20:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:20:28,671 INFO L471 AbstractCegarLoop]: Abstraction has 7175 states and 12177 transitions. [2025-01-09 05:20:28,672 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:20:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 7175 states and 12177 transitions. [2025-01-09 05:20:28,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:20:28,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:20:28,676 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:20:28,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:20:28,676 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:20:28,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:20:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash 647071149, now seen corresponding path program 1 times [2025-01-09 05:20:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:20:28,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291786438] [2025-01-09 05:20:28,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:20:28,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:20:28,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:20:28,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:20:28,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:20:28,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:20:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:20:28,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:20:28,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291786438] [2025-01-09 05:20:28,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291786438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:20:28,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:20:28,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:20:28,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511369187] [2025-01-09 05:20:28,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:20:28,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:20:28,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:20:28,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:20:28,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:20:28,784 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:20:29,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:20:29,460 INFO L93 Difference]: Finished difference Result 18276 states and 30976 transitions. [2025-01-09 05:20:29,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:20:29,460 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:20:29,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:20:29,502 INFO L225 Difference]: With dead ends: 18276 [2025-01-09 05:20:29,502 INFO L226 Difference]: Without dead ends: 13238 [2025-01-09 05:20:29,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:20:29,522 INFO L435 NwaCegarLoop]: 4495 mSDtfsCounter, 4745 mSDsluCounter, 13505 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:20:29,522 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.4s Time] [2025-01-09 05:20:29,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13238 states. [2025-01-09 05:20:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13238 to 12970. [2025-01-09 05:20:29,825 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:20:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12970 states to 12970 states and 22257 transitions. [2025-01-09 05:20:29,858 INFO L78 Accepts]: Start accepts. Automaton has 12970 states and 22257 transitions. Word has length 132 [2025-01-09 05:20:29,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:20:29,859 INFO L471 AbstractCegarLoop]: Abstraction has 12970 states and 22257 transitions. [2025-01-09 05:20:29,859 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:20:29,859 INFO L276 IsEmpty]: Start isEmpty. Operand 12970 states and 22257 transitions. [2025-01-09 05:20:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:20:29,864 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:20:29,865 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:20:29,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:20:29,865 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:20:29,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:20:29,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1494789329, now seen corresponding path program 1 times [2025-01-09 05:20:29,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:20:29,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883784374] [2025-01-09 05:20:29,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:20:29,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:20:29,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:20:29,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:20:29,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:20:29,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:20:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:20:29,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:20:29,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883784374] [2025-01-09 05:20:29,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883784374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:20:29,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:20:29,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:20:29,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516308715] [2025-01-09 05:20:29,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:20:29,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:20:29,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:20:29,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:20:29,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:20:29,959 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:20:30,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:20:30,509 INFO L93 Difference]: Finished difference Result 26743 states and 46767 transitions. [2025-01-09 05:20:30,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:20:30,510 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:20:30,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:20:30,561 INFO L225 Difference]: With dead ends: 26743 [2025-01-09 05:20:30,561 INFO L226 Difference]: Without dead ends: 15910 [2025-01-09 05:20:30,592 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:20:30,593 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:20:30,593 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:20:30,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15910 states. [2025-01-09 05:20:31,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15910 to 12970. [2025-01-09 05:20:31,024 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:20:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12970 states to 12970 states and 22224 transitions. [2025-01-09 05:20:31,066 INFO L78 Accepts]: Start accepts. Automaton has 12970 states and 22224 transitions. Word has length 132 [2025-01-09 05:20:31,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:20:31,066 INFO L471 AbstractCegarLoop]: Abstraction has 12970 states and 22224 transitions. [2025-01-09 05:20:31,066 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:20:31,066 INFO L276 IsEmpty]: Start isEmpty. Operand 12970 states and 22224 transitions. [2025-01-09 05:20:31,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:20:31,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:20:31,073 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:20:31,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:20:31,073 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:20:31,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:20:31,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2118070931, now seen corresponding path program 1 times [2025-01-09 05:20:31,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:20:31,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472451954] [2025-01-09 05:20:31,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:20:31,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:20:31,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:20:31,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:20:31,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:20:31,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:20:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:20:31,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:20:31,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472451954] [2025-01-09 05:20:31,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472451954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:20:31,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:20:31,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:20:31,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149860519] [2025-01-09 05:20:31,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:20:31,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:20:31,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:20:31,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:20:31,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:20:31,192 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:20:32,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:20:32,133 INFO L93 Difference]: Finished difference Result 37419 states and 65667 transitions. [2025-01-09 05:20:32,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:20:32,133 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:20:32,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:20:32,240 INFO L225 Difference]: With dead ends: 37419 [2025-01-09 05:20:32,241 INFO L226 Difference]: Without dead ends: 26586 [2025-01-09 05:20:32,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:20:32,279 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.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:20:32,279 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.4s Time] [2025-01-09 05:20:32,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26586 states. [2025-01-09 05:20:32,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26586 to 26180. [2025-01-09 05:20:32,969 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:20:33,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26180 states to 26180 states and 46626 transitions. [2025-01-09 05:20:33,042 INFO L78 Accepts]: Start accepts. Automaton has 26180 states and 46626 transitions. Word has length 132 [2025-01-09 05:20:33,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:20:33,042 INFO L471 AbstractCegarLoop]: Abstraction has 26180 states and 46626 transitions. [2025-01-09 05:20:33,042 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:20:33,042 INFO L276 IsEmpty]: Start isEmpty. Operand 26180 states and 46626 transitions. [2025-01-09 05:20:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:20:33,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:20:33,051 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:20:33,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:20:33,052 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:20:33,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:20:33,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1999629457, now seen corresponding path program 1 times [2025-01-09 05:20:33,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:20:33,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395054659] [2025-01-09 05:20:33,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:20:33,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:20:33,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:20:33,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:20:33,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:20:33,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:20:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:20:33,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:20:33,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395054659] [2025-01-09 05:20:33,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395054659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:20:33,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:20:33,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:20:33,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572135166] [2025-01-09 05:20:33,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:20:33,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:20:33,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:20:33,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:20:33,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:20:33,257 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:20:35,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:20:35,214 INFO L93 Difference]: Finished difference Result 85855 states and 159284 transitions. [2025-01-09 05:20:35,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:20:35,214 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:20:35,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:20:35,476 INFO L225 Difference]: With dead ends: 85855 [2025-01-09 05:20:35,476 INFO L226 Difference]: Without dead ends: 61812 [2025-01-09 05:20:35,548 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:20:35,549 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.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:20:35,549 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.5s Time] [2025-01-09 05:20:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61812 states. [2025-01-09 05:20:37,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61812 to 57025. [2025-01-09 05:20:37,299 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:20:37,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57025 states to 57025 states and 109062 transitions. [2025-01-09 05:20:37,558 INFO L78 Accepts]: Start accepts. Automaton has 57025 states and 109062 transitions. Word has length 132 [2025-01-09 05:20:37,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:20:37,558 INFO L471 AbstractCegarLoop]: Abstraction has 57025 states and 109062 transitions. [2025-01-09 05:20:37,558 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:20:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 57025 states and 109062 transitions. [2025-01-09 05:20:37,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:20:37,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:20:37,577 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:20:37,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:20:37,578 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:20:37,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:20:37,579 INFO L85 PathProgramCache]: Analyzing trace with hash -610335443, now seen corresponding path program 1 times [2025-01-09 05:20:37,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:20:37,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131241156] [2025-01-09 05:20:37,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:20:37,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:20:37,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:20:37,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:20:37,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:20:37,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:20:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:20:37,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:20:37,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131241156] [2025-01-09 05:20:37,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131241156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:20:37,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:20:37,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:20:37,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596898138] [2025-01-09 05:20:37,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:20:37,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:20:37,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:20:37,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:20:37,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:20:37,676 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:20:42,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:20:42,145 INFO L93 Difference]: Finished difference Result 194172 states and 397014 transitions. [2025-01-09 05:20:42,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:20:42,146 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:20:42,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:20:42,894 INFO L225 Difference]: With dead ends: 194172 [2025-01-09 05:20:42,894 INFO L226 Difference]: Without dead ends: 139284 [2025-01-09 05:20:43,094 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:20:43,095 INFO L435 NwaCegarLoop]: 4315 mSDtfsCounter, 4829 mSDsluCounter, 13054 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:20:43,095 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.5s Time] [2025-01-09 05:20:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139284 states. [2025-01-09 05:20:49,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139284 to 130404. [2025-01-09 05:20:49,984 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:20:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130404 states to 130404 states and 277706 transitions. [2025-01-09 05:20:50,956 INFO L78 Accepts]: Start accepts. Automaton has 130404 states and 277706 transitions. Word has length 132 [2025-01-09 05:20:50,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:20:50,957 INFO L471 AbstractCegarLoop]: Abstraction has 130404 states and 277706 transitions. [2025-01-09 05:20:50,957 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:20:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand 130404 states and 277706 transitions. [2025-01-09 05:20:51,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 05:20:51,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:20:51,188 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:20:51,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:20:51,188 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:20:51,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:20:51,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1651237807, now seen corresponding path program 1 times [2025-01-09 05:20:51,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:20:51,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431381908] [2025-01-09 05:20:51,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:20:51,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:20:51,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 05:20:51,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 05:20:51,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:20:51,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:20:51,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:20:51,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:20:51,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431381908] [2025-01-09 05:20:51,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431381908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:20:51,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:20:51,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:20:51,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763290079] [2025-01-09 05:20:51,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:20:51,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:20:51,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:20:51,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:20:51,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:20:51,439 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) [2025-01-09 05:21:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:02,441 INFO L93 Difference]: Finished difference Result 453255 states and 1063396 transitions. [2025-01-09 05:21:02,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:21:02,441 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:21:02,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:04,460 INFO L225 Difference]: With dead ends: 453255 [2025-01-09 05:21:04,460 INFO L226 Difference]: Without dead ends: 324988 [2025-01-09 05:21:04,929 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:21:04,930 INFO L435 NwaCegarLoop]: 4476 mSDtfsCounter, 4911 mSDsluCounter, 13444 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4936 SdHoareTripleChecker+Valid, 17920 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.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:21:04,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4936 Valid, 17920 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:21:05,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324988 states.