./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label41+token_ring.09.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_label41+token_ring.09.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 0e78e762388a6c3c1086d6b78561f9d228d7d6651a9ae559f7246d5d2e2293d4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:15:18,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:15:18,055 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:15:18,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:15:18,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:15:18,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:15:18,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:15:18,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:15:18,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:15:18,083 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:15:18,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:15:18,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:15:18,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:15:18,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:15:18,084 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:15:18,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:15:18,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:15:18,084 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:15:18,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:15:18,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:15:18,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:15:18,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:15:18,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:15:18,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:15:18,085 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:15:18,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:15:18,085 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:15:18,085 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:15:18,085 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:15:18,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:15:18,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:15:18,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:15:18,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:15:18,086 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:15:18,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:15:18,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:15:18,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:15:18,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:15:18,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:15:18,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:15:18,086 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:15:18,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:15:18,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:15:18,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:15:18,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:15:18,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:15:18,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:15:18,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:15:18,087 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 -> 0e78e762388a6c3c1086d6b78561f9d228d7d6651a9ae559f7246d5d2e2293d4 [2025-01-09 05:15:18,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:15:18,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:15:18,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:15:18,308 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:15:18,308 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:15:18,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label41+token_ring.09.cil-1.c [2025-01-09 05:15:19,459 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f20716190/89e7008ad0794feda191047767f7eb89/FLAGb9192a3bf [2025-01-09 05:15:20,044 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:15:20,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.09.cil-1.c [2025-01-09 05:15:20,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f20716190/89e7008ad0794feda191047767f7eb89/FLAGb9192a3bf [2025-01-09 05:15:20,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f20716190/89e7008ad0794feda191047767f7eb89 [2025-01-09 05:15:20,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:15:20,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:15:20,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:15:20,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:15:20,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:15:20,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:15:20" (1/1) ... [2025-01-09 05:15:20,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18efa3a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:20, skipping insertion in model container [2025-01-09 05:15:20,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:15:20" (1/1) ... [2025-01-09 05:15:20,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:15:21,362 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_label41+token_ring.09.cil-1.c[376251,376264] [2025-01-09 05:15:21,386 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_label41+token_ring.09.cil-1.c[383339,383352] [2025-01-09 05:15:21,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:15:21,653 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:15:22,176 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_label41+token_ring.09.cil-1.c[376251,376264] [2025-01-09 05:15:22,186 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.09.cil-1.c[383339,383352] [2025-01-09 05:15:22,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:15:22,264 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:15:22,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:22 WrapperNode [2025-01-09 05:15:22,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:15:22,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:15:22,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:15:22,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:15:22,276 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:15:22" (1/1) ... [2025-01-09 05:15:22,364 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:15:22" (1/1) ... [2025-01-09 05:15:22,698 INFO L138 Inliner]: procedures = 62, calls = 68, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 13014 [2025-01-09 05:15:22,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:15:22,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:15:22,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:15:22,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:15:22,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:22" (1/1) ... [2025-01-09 05:15:22,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:22" (1/1) ... [2025-01-09 05:15:22,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:22" (1/1) ... [2025-01-09 05:15:22,877 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:15:22,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:22" (1/1) ... [2025-01-09 05:15:22,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:22" (1/1) ... [2025-01-09 05:15:23,047 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:22" (1/1) ... [2025-01-09 05:15:23,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:22" (1/1) ... [2025-01-09 05:15:23,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:22" (1/1) ... [2025-01-09 05:15:23,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:22" (1/1) ... [2025-01-09 05:15:23,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:22" (1/1) ... [2025-01-09 05:15:23,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:15:23,221 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:15:23,221 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:15:23,221 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:15:23,222 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:22" (1/1) ... [2025-01-09 05:15:23,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:15:23,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:15:23,251 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:15:23,255 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:15:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:15:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:15:23,276 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:15:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:15:23,276 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:15:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:15:23,276 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:15:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:15:23,276 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:15:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:15:23,276 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:15:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:15:23,276 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:15:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:15:23,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:15:23,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:15:23,381 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:15:23,382 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:15:29,751 INFO L? ?]: Removed 1737 outVars from TransFormulas that were not future-live. [2025-01-09 05:15:29,752 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:15:29,810 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:15:29,810 INFO L312 CfgBuilder]: Removed 13 assume(true) statements. [2025-01-09 05:15:29,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:15:29 BoogieIcfgContainer [2025-01-09 05:15:29,811 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:15:29,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:15:29,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:15:29,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:15:29,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:15:20" (1/3) ... [2025-01-09 05:15:29,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c0c9b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:15:29, skipping insertion in model container [2025-01-09 05:15:29,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:15:22" (2/3) ... [2025-01-09 05:15:29,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c0c9b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:15:29, skipping insertion in model container [2025-01-09 05:15:29,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:15:29" (3/3) ... [2025-01-09 05:15:29,822 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label41+token_ring.09.cil-1.c [2025-01-09 05:15:29,832 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:15:29,835 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label41+token_ring.09.cil-1.c that has 7 procedures, 2488 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-01-09 05:15:29,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:15:29,922 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;@2f6b0ad1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:15:29,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:15:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 2488 states, 2457 states have (on average 1.8416768416768416) internal successors, (4525), 2459 states have internal predecessors, (4525), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 05:15:29,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:15:29,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:29,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:15:29,943 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:29,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:29,947 INFO L85 PathProgramCache]: Analyzing trace with hash 313623087, now seen corresponding path program 1 times [2025-01-09 05:15:29,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:29,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428205970] [2025-01-09 05:15:29,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:29,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:30,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:15:30,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:15:30,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:30,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:30,270 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:15:30,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:30,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428205970] [2025-01-09 05:15:30,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428205970] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:30,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:30,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:15:30,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117778052] [2025-01-09 05:15:30,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:30,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:15:30,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:30,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:15:30,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:15:30,300 INFO L87 Difference]: Start difference. First operand has 2488 states, 2457 states have (on average 1.8416768416768416) internal successors, (4525), 2459 states have internal predecessors, (4525), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (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:15:30,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:30,507 INFO L93 Difference]: Finished difference Result 4967 states and 9125 transitions. [2025-01-09 05:15:30,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:15:30,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (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 143 [2025-01-09 05:15:30,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:30,536 INFO L225 Difference]: With dead ends: 4967 [2025-01-09 05:15:30,536 INFO L226 Difference]: Without dead ends: 2421 [2025-01-09 05:15:30,546 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:15:30,548 INFO L435 NwaCegarLoop]: 4495 mSDtfsCounter, 465 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 8517 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:15:30,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 8517 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:15:30,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2025-01-09 05:15:30,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2421. [2025-01-09 05:15:30,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2421 states, 2390 states have (on average 1.8330543933054393) internal successors, (4381), 2392 states have internal predecessors, (4381), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 05:15:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 4427 transitions. [2025-01-09 05:15:30,666 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 4427 transitions. Word has length 143 [2025-01-09 05:15:30,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:30,667 INFO L471 AbstractCegarLoop]: Abstraction has 2421 states and 4427 transitions. [2025-01-09 05:15:30,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (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:15:30,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 4427 transitions. [2025-01-09 05:15:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:15:30,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:30,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:15:30,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:15:30,676 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:30,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:30,676 INFO L85 PathProgramCache]: Analyzing trace with hash 858495661, now seen corresponding path program 1 times [2025-01-09 05:15:30,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:30,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008749843] [2025-01-09 05:15:30,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:30,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:30,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:15:30,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:15:30,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:30,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:30,969 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:15:30,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:30,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008749843] [2025-01-09 05:15:30,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008749843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:30,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:30,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:15:30,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338334572] [2025-01-09 05:15:30,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:30,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:15:30,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:30,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:15:30,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:15:30,972 INFO L87 Difference]: Start difference. First operand 2421 states and 4427 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (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:15:31,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:31,553 INFO L93 Difference]: Finished difference Result 3023 states and 5383 transitions. [2025-01-09 05:15:31,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:15:31,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (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 143 [2025-01-09 05:15:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:31,567 INFO L225 Difference]: With dead ends: 3023 [2025-01-09 05:15:31,568 INFO L226 Difference]: Without dead ends: 2740 [2025-01-09 05:15:31,570 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:15:31,571 INFO L435 NwaCegarLoop]: 4321 mSDtfsCounter, 4851 mSDsluCounter, 8836 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4868 SdHoareTripleChecker+Valid, 13157 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:31,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4868 Valid, 13157 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:15:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2740 states. [2025-01-09 05:15:31,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2740 to 2717. [2025-01-09 05:15:31,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2717 states, 2661 states have (on average 1.8083427282976325) internal successors, (4812), 2664 states have internal predecessors, (4812), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-01-09 05:15:31,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 4895 transitions. [2025-01-09 05:15:31,650 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 4895 transitions. Word has length 143 [2025-01-09 05:15:31,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:31,651 INFO L471 AbstractCegarLoop]: Abstraction has 2717 states and 4895 transitions. [2025-01-09 05:15:31,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (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:15:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 4895 transitions. [2025-01-09 05:15:31,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:15:31,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:31,653 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:15:31,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:15:31,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:31,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:31,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1915106511, now seen corresponding path program 1 times [2025-01-09 05:15:31,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:31,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888415636] [2025-01-09 05:15:31,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:31,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:31,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:15:31,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:15:31,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:31,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:31,863 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:15:31,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:31,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888415636] [2025-01-09 05:15:31,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888415636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:31,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:31,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:31,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459536976] [2025-01-09 05:15:31,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:31,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:31,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:31,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:31,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:31,867 INFO L87 Difference]: Start difference. First operand 2717 states and 4895 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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:15:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:32,551 INFO L93 Difference]: Finished difference Result 3674 states and 6428 transitions. [2025-01-09 05:15:32,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:15:32,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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 143 [2025-01-09 05:15:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:32,564 INFO L225 Difference]: With dead ends: 3674 [2025-01-09 05:15:32,564 INFO L226 Difference]: Without dead ends: 3095 [2025-01-09 05:15:32,567 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:15:32,567 INFO L435 NwaCegarLoop]: 4567 mSDtfsCounter, 4855 mSDsluCounter, 13728 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4872 SdHoareTripleChecker+Valid, 18295 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:32,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4872 Valid, 18295 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:15:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2025-01-09 05:15:32,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 2992. [2025-01-09 05:15:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2992 states, 2911 states have (on average 1.7866712469941601) internal successors, (5201), 2915 states have internal predecessors, (5201), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (63), 60 states have call predecessors, (63), 59 states have call successors, (63) [2025-01-09 05:15:32,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2992 states to 2992 states and 5323 transitions. [2025-01-09 05:15:32,641 INFO L78 Accepts]: Start accepts. Automaton has 2992 states and 5323 transitions. Word has length 143 [2025-01-09 05:15:32,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:32,641 INFO L471 AbstractCegarLoop]: Abstraction has 2992 states and 5323 transitions. [2025-01-09 05:15:32,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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:15:32,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2992 states and 5323 transitions. [2025-01-09 05:15:32,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:15:32,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:32,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:15:32,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:15:32,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:32,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:32,644 INFO L85 PathProgramCache]: Analyzing trace with hash 329451887, now seen corresponding path program 1 times [2025-01-09 05:15:32,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:32,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132085028] [2025-01-09 05:15:32,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:32,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:32,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:15:32,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:15:32,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:32,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:32,823 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:15:32,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:32,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132085028] [2025-01-09 05:15:32,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132085028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:32,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:32,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:32,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689323271] [2025-01-09 05:15:32,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:32,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:32,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:32,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:32,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:32,825 INFO L87 Difference]: Start difference. First operand 2992 states and 5323 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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:15:33,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:33,456 INFO L93 Difference]: Finished difference Result 4543 states and 7799 transitions. [2025-01-09 05:15:33,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:15:33,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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 143 [2025-01-09 05:15:33,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:33,471 INFO L225 Difference]: With dead ends: 4543 [2025-01-09 05:15:33,471 INFO L226 Difference]: Without dead ends: 3689 [2025-01-09 05:15:33,475 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:15:33,475 INFO L435 NwaCegarLoop]: 4559 mSDtfsCounter, 4847 mSDsluCounter, 13706 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4864 SdHoareTripleChecker+Valid, 18265 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:33,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4864 Valid, 18265 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:15:33,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2025-01-09 05:15:33,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3576. [2025-01-09 05:15:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3576 states, 3443 states have (on average 1.7542840546035434) internal successors, (6040), 3451 states have internal predecessors, (6040), 95 states have call successors, (95), 30 states have call predecessors, (95), 36 states have return successors, (111), 98 states have call predecessors, (111), 95 states have call successors, (111) [2025-01-09 05:15:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3576 states to 3576 states and 6246 transitions. [2025-01-09 05:15:33,642 INFO L78 Accepts]: Start accepts. Automaton has 3576 states and 6246 transitions. Word has length 143 [2025-01-09 05:15:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:33,642 INFO L471 AbstractCegarLoop]: Abstraction has 3576 states and 6246 transitions. [2025-01-09 05:15:33,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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:15:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 6246 transitions. [2025-01-09 05:15:33,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:15:33,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:33,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:15:33,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:15:33,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:33,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:33,645 INFO L85 PathProgramCache]: Analyzing trace with hash -763183315, now seen corresponding path program 1 times [2025-01-09 05:15:33,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:33,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453398877] [2025-01-09 05:15:33,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:33,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:33,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:15:33,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:15:33,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:33,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:33,778 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:15:33,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:33,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453398877] [2025-01-09 05:15:33,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453398877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:33,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:33,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:33,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223204964] [2025-01-09 05:15:33,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:33,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:33,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:33,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:33,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:33,780 INFO L87 Difference]: Start difference. First operand 3576 states and 6246 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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:15:34,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:34,378 INFO L93 Difference]: Finished difference Result 6423 states and 10828 transitions. [2025-01-09 05:15:34,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:15:34,379 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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 143 [2025-01-09 05:15:34,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:34,398 INFO L225 Difference]: With dead ends: 6423 [2025-01-09 05:15:34,398 INFO L226 Difference]: Without dead ends: 4985 [2025-01-09 05:15:34,404 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:15:34,405 INFO L435 NwaCegarLoop]: 4556 mSDtfsCounter, 4842 mSDsluCounter, 13697 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4859 SdHoareTripleChecker+Valid, 18253 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:34,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4859 Valid, 18253 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:15:34,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4985 states. [2025-01-09 05:15:34,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4985 to 4843. [2025-01-09 05:15:34,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4843 states, 4600 states have (on average 1.7165217391304348) internal successors, (7896), 4622 states have internal predecessors, (7896), 167 states have call successors, (167), 54 states have call predecessors, (167), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-01-09 05:15:34,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4843 states to 4843 states and 8294 transitions. [2025-01-09 05:15:34,561 INFO L78 Accepts]: Start accepts. Automaton has 4843 states and 8294 transitions. Word has length 143 [2025-01-09 05:15:34,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:34,561 INFO L471 AbstractCegarLoop]: Abstraction has 4843 states and 8294 transitions. [2025-01-09 05:15:34,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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:15:34,562 INFO L276 IsEmpty]: Start isEmpty. Operand 4843 states and 8294 transitions. [2025-01-09 05:15:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:15:34,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:34,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:15:34,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:15:34,565 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:34,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:34,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2045355601, now seen corresponding path program 1 times [2025-01-09 05:15:34,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:34,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285468301] [2025-01-09 05:15:34,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:34,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:34,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:15:34,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:15:34,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:34,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:34,700 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:15:34,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:34,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285468301] [2025-01-09 05:15:34,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285468301] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:34,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:34,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:34,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914758982] [2025-01-09 05:15:34,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:34,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:34,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:34,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:34,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:34,702 INFO L87 Difference]: Start difference. First operand 4843 states and 8294 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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:15:35,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:35,360 INFO L93 Difference]: Finished difference Result 10560 states and 17682 transitions. [2025-01-09 05:15:35,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:15:35,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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 143 [2025-01-09 05:15:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:35,395 INFO L225 Difference]: With dead ends: 10560 [2025-01-09 05:15:35,396 INFO L226 Difference]: Without dead ends: 7855 [2025-01-09 05:15:35,406 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:15:35,407 INFO L435 NwaCegarLoop]: 4553 mSDtfsCounter, 4837 mSDsluCounter, 13688 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4854 SdHoareTripleChecker+Valid, 18241 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:35,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4854 Valid, 18241 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:15:35,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7855 states. [2025-01-09 05:15:35,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7855 to 7656. [2025-01-09 05:15:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7656 states, 7175 states have (on average 1.6875261324041813) internal successors, (12108), 7243 states have internal predecessors, (12108), 311 states have call successors, (311), 102 states have call predecessors, (311), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-01-09 05:15:35,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7656 states to 7656 states and 12986 transitions. [2025-01-09 05:15:35,757 INFO L78 Accepts]: Start accepts. Automaton has 7656 states and 12986 transitions. Word has length 143 [2025-01-09 05:15:35,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:35,757 INFO L471 AbstractCegarLoop]: Abstraction has 7656 states and 12986 transitions. [2025-01-09 05:15:35,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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:15:35,758 INFO L276 IsEmpty]: Start isEmpty. Operand 7656 states and 12986 transitions. [2025-01-09 05:15:35,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:15:35,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:35,762 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:15:35,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:15:35,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:35,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:35,763 INFO L85 PathProgramCache]: Analyzing trace with hash 407135981, now seen corresponding path program 1 times [2025-01-09 05:15:35,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:35,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388973671] [2025-01-09 05:15:35,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:35,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:35,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:15:35,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:15:35,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:35,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:35,874 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:15:35,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:35,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388973671] [2025-01-09 05:15:35,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388973671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:35,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:35,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:35,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741194067] [2025-01-09 05:15:35,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:35,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:35,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:35,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:35,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:35,876 INFO L87 Difference]: Start difference. First operand 7656 states and 12986 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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:15:36,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:36,566 INFO L93 Difference]: Finished difference Result 19891 states and 33756 transitions. [2025-01-09 05:15:36,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:15:36,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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 143 [2025-01-09 05:15:36,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:36,626 INFO L225 Difference]: With dead ends: 19891 [2025-01-09 05:15:36,627 INFO L226 Difference]: Without dead ends: 14373 [2025-01-09 05:15:36,650 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:15:36,651 INFO L435 NwaCegarLoop]: 4343 mSDtfsCounter, 4864 mSDsluCounter, 13191 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4881 SdHoareTripleChecker+Valid, 17534 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:36,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4881 Valid, 17534 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:15:36,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14373 states. [2025-01-09 05:15:37,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14373 to 14065. [2025-01-09 05:15:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14065 states, 13054 states have (on average 1.67979163474797) internal successors, (21928), 13268 states have internal predecessors, (21928), 599 states have call successors, (599), 198 states have call predecessors, (599), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-01-09 05:15:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14065 states to 14065 states and 24150 transitions. [2025-01-09 05:15:37,148 INFO L78 Accepts]: Start accepts. Automaton has 14065 states and 24150 transitions. Word has length 143 [2025-01-09 05:15:37,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:37,148 INFO L471 AbstractCegarLoop]: Abstraction has 14065 states and 24150 transitions. [2025-01-09 05:15:37,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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:15:37,149 INFO L276 IsEmpty]: Start isEmpty. Operand 14065 states and 24150 transitions. [2025-01-09 05:15:37,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:15:37,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:37,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:15:37,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:15:37,159 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:37,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:37,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1314866705, now seen corresponding path program 1 times [2025-01-09 05:15:37,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:37,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974739794] [2025-01-09 05:15:37,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:37,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:37,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:15:37,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:15:37,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:37,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:37,289 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:15:37,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:37,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974739794] [2025-01-09 05:15:37,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974739794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:37,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:37,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:15:37,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456211476] [2025-01-09 05:15:37,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:37,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:15:37,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:37,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:15:37,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:15:37,292 INFO L87 Difference]: Start difference. First operand 14065 states and 24150 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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:15:37,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:37,836 INFO L93 Difference]: Finished difference Result 29422 states and 51531 transitions. [2025-01-09 05:15:37,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:15:37,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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 143 [2025-01-09 05:15:37,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:37,898 INFO L225 Difference]: With dead ends: 29422 [2025-01-09 05:15:37,898 INFO L226 Difference]: Without dead ends: 17495 [2025-01-09 05:15:37,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:37,938 INFO L435 NwaCegarLoop]: 4298 mSDtfsCounter, 4585 mSDsluCounter, 8471 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4602 SdHoareTripleChecker+Valid, 12769 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:37,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4602 Valid, 12769 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:15:37,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17495 states. [2025-01-09 05:15:38,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17495 to 14065. [2025-01-09 05:15:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14065 states, 13054 states have (on average 1.6772636739696645) internal successors, (21895), 13268 states have internal predecessors, (21895), 599 states have call successors, (599), 198 states have call predecessors, (599), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-01-09 05:15:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14065 states to 14065 states and 24117 transitions. [2025-01-09 05:15:38,646 INFO L78 Accepts]: Start accepts. Automaton has 14065 states and 24117 transitions. Word has length 143 [2025-01-09 05:15:38,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:38,647 INFO L471 AbstractCegarLoop]: Abstraction has 14065 states and 24117 transitions. [2025-01-09 05:15:38,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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:15:38,647 INFO L276 IsEmpty]: Start isEmpty. Operand 14065 states and 24117 transitions. [2025-01-09 05:15:38,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:15:38,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:38,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:15:38,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:15:38,656 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:38,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:38,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1647509843, now seen corresponding path program 1 times [2025-01-09 05:15:38,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:38,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886467560] [2025-01-09 05:15:38,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:38,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:38,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:15:38,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:15:38,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:38,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:38,823 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:15:38,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:38,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886467560] [2025-01-09 05:15:38,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886467560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:38,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:38,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:38,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541736975] [2025-01-09 05:15:38,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:38,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:38,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:38,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:38,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:38,826 INFO L87 Difference]: Start difference. First operand 14065 states and 24117 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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:15:40,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:40,049 INFO L93 Difference]: Finished difference Result 41232 states and 72411 transitions. [2025-01-09 05:15:40,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:15:40,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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 143 [2025-01-09 05:15:40,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:40,144 INFO L225 Difference]: With dead ends: 41232 [2025-01-09 05:15:40,144 INFO L226 Difference]: Without dead ends: 29305 [2025-01-09 05:15:40,177 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:15:40,179 INFO L435 NwaCegarLoop]: 4542 mSDtfsCounter, 4819 mSDsluCounter, 13656 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4836 SdHoareTripleChecker+Valid, 18198 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:40,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4836 Valid, 18198 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:15:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29305 states. [2025-01-09 05:15:40,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29305 to 28827. [2025-01-09 05:15:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28827 states, 26594 states have (on average 1.687937128675641) internal successors, (44889), 27262 states have internal predecessors, (44889), 1175 states have call successors, (1175), 390 states have call predecessors, (1175), 1056 states have return successors, (5271), 1238 states have call predecessors, (5271), 1175 states have call successors, (5271) [2025-01-09 05:15:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28827 states to 28827 states and 51335 transitions. [2025-01-09 05:15:41,060 INFO L78 Accepts]: Start accepts. Automaton has 28827 states and 51335 transitions. Word has length 143 [2025-01-09 05:15:41,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:41,061 INFO L471 AbstractCegarLoop]: Abstraction has 28827 states and 51335 transitions. [2025-01-09 05:15:41,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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:15:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 28827 states and 51335 transitions. [2025-01-09 05:15:41,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:15:41,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:15:41,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:15:41,073 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:41,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:41,075 INFO L85 PathProgramCache]: Analyzing trace with hash 281422383, now seen corresponding path program 1 times [2025-01-09 05:15:41,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:41,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132940899] [2025-01-09 05:15:41,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:41,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:41,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:15:41,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:15:41,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:41,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:41,186 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:15:41,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:41,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132940899] [2025-01-09 05:15:41,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132940899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:41,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:41,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:41,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293067653] [2025-01-09 05:15:41,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:41,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:41,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:41,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:41,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:41,187 INFO L87 Difference]: Start difference. First operand 28827 states and 51335 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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:15:42,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:42,859 INFO L93 Difference]: Finished difference Result 91456 states and 170595 transitions. [2025-01-09 05:15:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:15:42,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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 143 [2025-01-09 05:15:42,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:43,349 INFO L225 Difference]: With dead ends: 91456 [2025-01-09 05:15:43,349 INFO L226 Difference]: Without dead ends: 64767 [2025-01-09 05:15:43,424 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:15:43,425 INFO L435 NwaCegarLoop]: 4539 mSDtfsCounter, 4814 mSDsluCounter, 13647 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4831 SdHoareTripleChecker+Valid, 18186 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:43,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4831 Valid, 18186 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:15:43,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64767 states. [2025-01-09 05:15:45,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64767 to 63940. [2025-01-09 05:15:45,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63940 states, 58777 states have (on average 1.7109583680691427) internal successors, (100565), 60839 states have internal predecessors, (100565), 2327 states have call successors, (2327), 774 states have call predecessors, (2327), 2834 states have return successors, (18711), 2454 states have call predecessors, (18711), 2327 states have call successors, (18711) [2025-01-09 05:15:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63940 states to 63940 states and 121603 transitions. [2025-01-09 05:15:46,066 INFO L78 Accepts]: Start accepts. Automaton has 63940 states and 121603 transitions. Word has length 143 [2025-01-09 05:15:46,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:46,066 INFO L471 AbstractCegarLoop]: Abstraction has 63940 states and 121603 transitions. [2025-01-09 05:15:46,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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:15:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 63940 states and 121603 transitions. [2025-01-09 05:15:46,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:15:46,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:46,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:15:46,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:15:46,085 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:46,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:46,086 INFO L85 PathProgramCache]: Analyzing trace with hash -2011658643, now seen corresponding path program 1 times [2025-01-09 05:15:46,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:46,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482432650] [2025-01-09 05:15:46,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:46,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:46,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:15:46,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:15:46,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:46,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:46,209 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:15:46,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:46,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482432650] [2025-01-09 05:15:46,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482432650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:46,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:46,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:46,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675541540] [2025-01-09 05:15:46,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:46,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:46,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:46,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:46,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:46,212 INFO L87 Difference]: Start difference. First operand 63940 states and 121603 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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:15:51,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:15:51,365 INFO L93 Difference]: Finished difference Result 218103 states and 440698 transitions. [2025-01-09 05:15:51,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:15:51,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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 143 [2025-01-09 05:15:51,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:15:52,232 INFO L225 Difference]: With dead ends: 218103 [2025-01-09 05:15:52,232 INFO L226 Difference]: Without dead ends: 156301 [2025-01-09 05:15:52,504 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:15:52,505 INFO L435 NwaCegarLoop]: 4529 mSDtfsCounter, 4888 mSDsluCounter, 13614 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4904 SdHoareTripleChecker+Valid, 18143 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:15:52,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4904 Valid, 18143 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:15:52,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156301 states. [2025-01-09 05:15:58,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156301 to 146392. [2025-01-09 05:15:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146392 states, 134039 states have (on average 1.7350994859705011) internal successors, (232571), 140347 states have internal predecessors, (232571), 4503 states have call successors, (4503), 1542 states have call predecessors, (4503), 7848 states have return successors, (70039), 4758 states have call predecessors, (70039), 4503 states have call successors, (70039) [2025-01-09 05:15:59,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146392 states to 146392 states and 307113 transitions. [2025-01-09 05:15:59,522 INFO L78 Accepts]: Start accepts. Automaton has 146392 states and 307113 transitions. Word has length 143 [2025-01-09 05:15:59,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:15:59,523 INFO L471 AbstractCegarLoop]: Abstraction has 146392 states and 307113 transitions. [2025-01-09 05:15:59,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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:15:59,523 INFO L276 IsEmpty]: Start isEmpty. Operand 146392 states and 307113 transitions. [2025-01-09 05:15:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:15:59,560 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:15:59,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:15:59,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:15:59,561 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:15:59,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:15:59,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1540302293, now seen corresponding path program 1 times [2025-01-09 05:15:59,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:15:59,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125000689] [2025-01-09 05:15:59,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:15:59,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:15:59,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:15:59,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:15:59,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:15:59,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:15:59,671 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:15:59,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:15:59,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125000689] [2025-01-09 05:15:59,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125000689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:15:59,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:15:59,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:15:59,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412553639] [2025-01-09 05:15:59,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:15:59,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:15:59,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:15:59,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:15:59,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:15:59,672 INFO L87 Difference]: Start difference. First operand 146392 states and 307113 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (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)