./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-59.i -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 c3eff42a8b8c884ae11f90d187410b4308f7ccc8d2492e13c8b7c80478f2454e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:59:30,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:59:30,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:59:30,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:59:30,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:59:30,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:59:30,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:59:30,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:59:30,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:59:30,345 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:59:30,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:59:30,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:59:30,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:59:30,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:59:30,346 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:59:30,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:59:30,346 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:59:30,346 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:59:30,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:59:30,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:59:30,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:59:30,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:59:30,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:59:30,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:59:30,347 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:59:30,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:59:30,347 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:59:30,347 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:59:30,347 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:59:30,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:59:30,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:59:30,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:59:30,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:59:30,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:59:30,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:59:30,348 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:59:30,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:59:30,349 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:59:30,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:59:30,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:59:30,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:59:30,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:59:30,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:59:30,349 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 -> c3eff42a8b8c884ae11f90d187410b4308f7ccc8d2492e13c8b7c80478f2454e [2025-02-05 21:59:30,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:59:30,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:59:30,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:59:30,613 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:59:30,614 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:59:30,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-59.i [2025-02-05 21:59:31,838 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a0592825/519bf9a6a0b64acda0ad72ec62330cca/FLAG3735eccb7 [2025-02-05 21:59:31,851 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException: Cannot invoke "String.equalsIgnoreCase(String)" because "kindStr" is null at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-02-05 21:59:32,173 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:59:32,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-59.i [2025-02-05 21:59:32,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a0592825/519bf9a6a0b64acda0ad72ec62330cca/FLAG3735eccb7 [2025-02-05 21:59:32,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a0592825/519bf9a6a0b64acda0ad72ec62330cca [2025-02-05 21:59:32,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:59:32,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:59:32,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:59:32,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:59:32,209 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:59:32,210 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:59:32" (1/1) ... [2025-02-05 21:59:32,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d74b9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:32, skipping insertion in model container [2025-02-05 21:59:32,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:59:32" (1/1) ... [2025-02-05 21:59:32,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:59:32,324 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-59.i[916,929] [2025-02-05 21:59:32,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:59:32,452 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:59:32,471 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-59.i[916,929] [2025-02-05 21:59:32,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:59:32,569 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:59:32,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:32 WrapperNode [2025-02-05 21:59:32,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:59:32,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:59:32,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:59:32,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:59:32,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:32" (1/1) ... [2025-02-05 21:59:32,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:32" (1/1) ... [2025-02-05 21:59:32,669 INFO L138 Inliner]: procedures = 26, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 889 [2025-02-05 21:59:32,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:59:32,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:59:32,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:59:32,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:59:32,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:32" (1/1) ... [2025-02-05 21:59:32,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:32" (1/1) ... [2025-02-05 21:59:32,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:32" (1/1) ... [2025-02-05 21:59:32,722 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-02-05 21:59:32,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:32" (1/1) ... [2025-02-05 21:59:32,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:32" (1/1) ... [2025-02-05 21:59:32,741 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:32" (1/1) ... [2025-02-05 21:59:32,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:32" (1/1) ... [2025-02-05 21:59:32,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:32" (1/1) ... [2025-02-05 21:59:32,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:32" (1/1) ... [2025-02-05 21:59:32,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:59:32,765 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:59:32,765 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:59:32,765 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:59:32,766 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:32" (1/1) ... [2025-02-05 21:59:32,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:59:32,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:59:32,792 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-02-05 21:59:32,795 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-02-05 21:59:32,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:59:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:59:32,813 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:59:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:59:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:59:32,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:59:32,939 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:59:32,941 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:59:34,033 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-02-05 21:59:34,034 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:59:34,055 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:59:34,055 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 21:59:34,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:59:34 BoogieIcfgContainer [2025-02-05 21:59:34,056 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:59:34,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:59:34,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:59:34,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:59:34,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:59:32" (1/3) ... [2025-02-05 21:59:34,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f57bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:59:34, skipping insertion in model container [2025-02-05 21:59:34,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:32" (2/3) ... [2025-02-05 21:59:34,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f57bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:59:34, skipping insertion in model container [2025-02-05 21:59:34,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:59:34" (3/3) ... [2025-02-05 21:59:34,064 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-59.i [2025-02-05 21:59:34,075 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:59:34,077 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-59.i that has 2 procedures, 371 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:59:34,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:59:34,152 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;@88af648, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:59:34,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:59:34,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 371 states, 252 states have (on average 1.5753968253968254) internal successors, (397), 253 states have internal predecessors, (397), 116 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2025-02-05 21:59:34,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2025-02-05 21:59:34,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:34,186 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:34,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:34,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:34,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1978735810, now seen corresponding path program 1 times [2025-02-05 21:59:34,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:34,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038099264] [2025-02-05 21:59:34,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:34,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:34,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-02-05 21:59:34,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-02-05 21:59:34,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:34,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 26450 trivial. 0 not checked. [2025-02-05 21:59:34,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:34,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038099264] [2025-02-05 21:59:34,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038099264] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:59:34,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741443742] [2025-02-05 21:59:34,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:34,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:59:34,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:59:34,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:59:34,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:59:34,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-02-05 21:59:35,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-02-05 21:59:35,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:35,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:35,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 1645 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:59:35,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:59:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 26450 trivial. 0 not checked. [2025-02-05 21:59:35,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:59:35,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741443742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:35,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:59:35,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:59:35,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702829729] [2025-02-05 21:59:35,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:35,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:59:35,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:35,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:59:35,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:59:35,329 INFO L87 Difference]: Start difference. First operand has 371 states, 252 states have (on average 1.5753968253968254) internal successors, (397), 253 states have internal predecessors, (397), 116 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) Second operand has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 2 states have call successors, (116), 2 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 2 states have call successors, (116) [2025-02-05 21:59:35,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:35,437 INFO L93 Difference]: Finished difference Result 736 states and 1369 transitions. [2025-02-05 21:59:35,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:59:35,440 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 2 states have call successors, (116), 2 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 2 states have call successors, (116) Word has length 731 [2025-02-05 21:59:35,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:35,451 INFO L225 Difference]: With dead ends: 736 [2025-02-05 21:59:35,451 INFO L226 Difference]: Without dead ends: 368 [2025-02-05 21:59:35,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 732 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:59:35,457 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:35,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 605 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:35,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-02-05 21:59:35,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-02-05 21:59:35,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 250 states have (on average 1.568) internal successors, (392), 250 states have internal predecessors, (392), 116 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2025-02-05 21:59:35,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 624 transitions. [2025-02-05 21:59:35,522 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 624 transitions. Word has length 731 [2025-02-05 21:59:35,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:35,523 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 624 transitions. [2025-02-05 21:59:35,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 2 states have call successors, (116), 2 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 2 states have call successors, (116) [2025-02-05 21:59:35,523 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 624 transitions. [2025-02-05 21:59:35,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2025-02-05 21:59:35,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:35,538 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:35,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:59:35,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:59:35,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:35,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:35,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1554360492, now seen corresponding path program 1 times [2025-02-05 21:59:35,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:35,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282182754] [2025-02-05 21:59:35,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:35,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:35,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-02-05 21:59:35,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-02-05 21:59:35,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:35,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:36,713 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:59:36,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:36,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282182754] [2025-02-05 21:59:36,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282182754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:36,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:36,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:59:36,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757369013] [2025-02-05 21:59:36,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:36,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:59:36,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:36,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:59:36,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:36,720 INFO L87 Difference]: Start difference. First operand 368 states and 624 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:59:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:37,602 INFO L93 Difference]: Finished difference Result 1453 states and 2469 transitions. [2025-02-05 21:59:37,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:59:37,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 731 [2025-02-05 21:59:37,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:37,615 INFO L225 Difference]: With dead ends: 1453 [2025-02-05 21:59:37,615 INFO L226 Difference]: Without dead ends: 1088 [2025-02-05 21:59:37,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:59:37,617 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 1042 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:37,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 1836 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:59:37,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2025-02-05 21:59:37,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1078. [2025-02-05 21:59:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 726 states have (on average 1.5633608815426998) internal successors, (1135), 726 states have internal predecessors, (1135), 348 states have call successors, (348), 3 states have call predecessors, (348), 3 states have return successors, (348), 348 states have call predecessors, (348), 348 states have call successors, (348) [2025-02-05 21:59:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1831 transitions. [2025-02-05 21:59:37,739 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1831 transitions. Word has length 731 [2025-02-05 21:59:37,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:37,740 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1831 transitions. [2025-02-05 21:59:37,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:59:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1831 transitions. [2025-02-05 21:59:37,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2025-02-05 21:59:37,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:37,751 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:37,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:59:37,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:37,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:37,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1436213075, now seen corresponding path program 1 times [2025-02-05 21:59:37,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:37,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155260545] [2025-02-05 21:59:37,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:37,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:37,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-02-05 21:59:37,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-02-05 21:59:37,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:37,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:38,004 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:59:38,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:38,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155260545] [2025-02-05 21:59:38,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155260545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:38,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:38,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:38,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756027024] [2025-02-05 21:59:38,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:38,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:38,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:38,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:38,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:38,007 INFO L87 Difference]: Start difference. First operand 1078 states and 1831 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:59:38,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:38,130 INFO L93 Difference]: Finished difference Result 2406 states and 4083 transitions. [2025-02-05 21:59:38,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:38,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 731 [2025-02-05 21:59:38,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:38,138 INFO L225 Difference]: With dead ends: 2406 [2025-02-05 21:59:38,138 INFO L226 Difference]: Without dead ends: 1331 [2025-02-05 21:59:38,140 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-02-05 21:59:38,141 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 342 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:38,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1274 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-02-05 21:59:38,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1327. [2025-02-05 21:59:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 916 states have (on average 1.5600436681222707) internal successors, (1429), 918 states have internal predecessors, (1429), 404 states have call successors, (404), 6 states have call predecessors, (404), 6 states have return successors, (404), 402 states have call predecessors, (404), 404 states have call successors, (404) [2025-02-05 21:59:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 2237 transitions. [2025-02-05 21:59:38,229 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 2237 transitions. Word has length 731 [2025-02-05 21:59:38,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:38,230 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 2237 transitions. [2025-02-05 21:59:38,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:59:38,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 2237 transitions. [2025-02-05 21:59:38,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2025-02-05 21:59:38,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:38,235 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:38,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:59:38,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:38,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:38,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1335301108, now seen corresponding path program 1 times [2025-02-05 21:59:38,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:38,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875829536] [2025-02-05 21:59:38,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:38,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:38,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-02-05 21:59:38,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-02-05 21:59:38,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:38,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:59:38,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:38,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875829536] [2025-02-05 21:59:38,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875829536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:38,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:38,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:38,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664885309] [2025-02-05 21:59:38,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:38,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:38,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:38,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:38,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:38,698 INFO L87 Difference]: Start difference. First operand 1327 states and 2237 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:59:38,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:38,881 INFO L93 Difference]: Finished difference Result 3887 states and 6561 transitions. [2025-02-05 21:59:38,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:38,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 731 [2025-02-05 21:59:38,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:38,898 INFO L225 Difference]: With dead ends: 3887 [2025-02-05 21:59:38,898 INFO L226 Difference]: Without dead ends: 2607 [2025-02-05 21:59:38,903 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-02-05 21:59:38,903 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 412 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:38,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1363 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:38,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states. [2025-02-05 21:59:39,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 2605. [2025-02-05 21:59:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2605 states, 1812 states have (on average 1.5640176600441502) internal successors, (2834), 1815 states have internal predecessors, (2834), 780 states have call successors, (780), 12 states have call predecessors, (780), 12 states have return successors, (780), 777 states have call predecessors, (780), 780 states have call successors, (780) [2025-02-05 21:59:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 4394 transitions. [2025-02-05 21:59:39,114 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 4394 transitions. Word has length 731 [2025-02-05 21:59:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:39,115 INFO L471 AbstractCegarLoop]: Abstraction has 2605 states and 4394 transitions. [2025-02-05 21:59:39,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:59:39,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 4394 transitions. [2025-02-05 21:59:39,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2025-02-05 21:59:39,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:39,122 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:39,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:59:39,122 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:39,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:39,123 INFO L85 PathProgramCache]: Analyzing trace with hash -453760790, now seen corresponding path program 1 times [2025-02-05 21:59:39,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:39,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007987479] [2025-02-05 21:59:39,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:39,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:39,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-02-05 21:59:39,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-02-05 21:59:39,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:39,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:59:39,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:39,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007987479] [2025-02-05 21:59:39,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007987479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:39,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:39,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:59:39,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241779463] [2025-02-05 21:59:39,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:39,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:59:39,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:39,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:59:39,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:39,501 INFO L87 Difference]: Start difference. First operand 2605 states and 4394 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 2 states have call predecessors, (116), 2 states have call successors, (116) [2025-02-05 21:59:40,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:40,247 INFO L93 Difference]: Finished difference Result 6299 states and 10656 transitions. [2025-02-05 21:59:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:40,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 2 states have call predecessors, (116), 2 states have call successors, (116) Word has length 731 [2025-02-05 21:59:40,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:40,278 INFO L225 Difference]: With dead ends: 6299 [2025-02-05 21:59:40,278 INFO L226 Difference]: Without dead ends: 3741 [2025-02-05 21:59:40,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:59:40,289 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 695 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:40,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 1823 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:59:40,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2025-02-05 21:59:40,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3739. [2025-02-05 21:59:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3739 states, 2654 states have (on average 1.5802562170308967) internal successors, (4194), 2659 states have internal predecessors, (4194), 1068 states have call successors, (1068), 16 states have call predecessors, (1068), 16 states have return successors, (1068), 1063 states have call predecessors, (1068), 1068 states have call successors, (1068) [2025-02-05 21:59:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 6330 transitions. [2025-02-05 21:59:40,610 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 6330 transitions. Word has length 731 [2025-02-05 21:59:40,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:40,611 INFO L471 AbstractCegarLoop]: Abstraction has 3739 states and 6330 transitions. [2025-02-05 21:59:40,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 2 states have call predecessors, (116), 2 states have call successors, (116) [2025-02-05 21:59:40,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 6330 transitions. [2025-02-05 21:59:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2025-02-05 21:59:40,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:40,618 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:40,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:59:40,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:40,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:40,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1447198852, now seen corresponding path program 1 times [2025-02-05 21:59:40,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:40,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096520599] [2025-02-05 21:59:40,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:40,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:40,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-02-05 21:59:40,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-02-05 21:59:40,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:40,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:59:40,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:40,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096520599] [2025-02-05 21:59:40,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096520599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:40,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:40,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:40,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000249485] [2025-02-05 21:59:40,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:40,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:40,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:40,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:40,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:40,974 INFO L87 Difference]: Start difference. First operand 3739 states and 6330 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:59:41,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:41,400 INFO L93 Difference]: Finished difference Result 8859 states and 14964 transitions. [2025-02-05 21:59:41,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:41,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 731 [2025-02-05 21:59:41,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:41,434 INFO L225 Difference]: With dead ends: 8859 [2025-02-05 21:59:41,434 INFO L226 Difference]: Without dead ends: 5167 [2025-02-05 21:59:41,448 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-02-05 21:59:41,449 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 395 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:41,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1182 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:59:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5167 states. [2025-02-05 21:59:41,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5167 to 5153. [2025-02-05 21:59:41,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5153 states, 3596 states have (on average 1.5628476084538376) internal successors, (5620), 3601 states have internal predecessors, (5620), 1532 states have call successors, (1532), 24 states have call predecessors, (1532), 24 states have return successors, (1532), 1527 states have call predecessors, (1532), 1532 states have call successors, (1532) [2025-02-05 21:59:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 8684 transitions. [2025-02-05 21:59:41,856 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 8684 transitions. Word has length 731 [2025-02-05 21:59:41,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:41,857 INFO L471 AbstractCegarLoop]: Abstraction has 5153 states and 8684 transitions. [2025-02-05 21:59:41,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:59:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 8684 transitions. [2025-02-05 21:59:41,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2025-02-05 21:59:41,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:41,865 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:41,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:59:41,865 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:41,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:41,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1200885765, now seen corresponding path program 1 times [2025-02-05 21:59:41,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:41,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117142309] [2025-02-05 21:59:41,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:41,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:41,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-02-05 21:59:41,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-02-05 21:59:41,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:41,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:42,054 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:59:42,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:42,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117142309] [2025-02-05 21:59:42,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117142309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:42,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:42,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:42,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105805459] [2025-02-05 21:59:42,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:42,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:42,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:42,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:42,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:42,057 INFO L87 Difference]: Start difference. First operand 5153 states and 8684 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:59:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:42,434 INFO L93 Difference]: Finished difference Result 13593 states and 22986 transitions. [2025-02-05 21:59:42,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:42,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 731 [2025-02-05 21:59:42,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:42,493 INFO L225 Difference]: With dead ends: 13593 [2025-02-05 21:59:42,496 INFO L226 Difference]: Without dead ends: 8487 [2025-02-05 21:59:42,513 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-02-05 21:59:42,513 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 364 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:42,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1523 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:42,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2025-02-05 21:59:43,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 8465. [2025-02-05 21:59:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8465 states, 6388 states have (on average 1.6048841577958672) internal successors, (10252), 6409 states have internal predecessors, (10252), 2028 states have call successors, (2028), 48 states have call predecessors, (2028), 48 states have return successors, (2028), 2007 states have call predecessors, (2028), 2028 states have call successors, (2028) [2025-02-05 21:59:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8465 states to 8465 states and 14308 transitions. [2025-02-05 21:59:43,083 INFO L78 Accepts]: Start accepts. Automaton has 8465 states and 14308 transitions. Word has length 731 [2025-02-05 21:59:43,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:43,084 INFO L471 AbstractCegarLoop]: Abstraction has 8465 states and 14308 transitions. [2025-02-05 21:59:43,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:59:43,085 INFO L276 IsEmpty]: Start isEmpty. Operand 8465 states and 14308 transitions. [2025-02-05 21:59:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-02-05 21:59:43,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:43,097 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:43,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:59:43,097 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:43,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:43,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1549203984, now seen corresponding path program 1 times [2025-02-05 21:59:43,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:43,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018264756] [2025-02-05 21:59:43,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:43,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:43,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-02-05 21:59:43,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-02-05 21:59:43,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:43,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:59:43,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:43,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018264756] [2025-02-05 21:59:43,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018264756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:43,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:43,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:43,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783972341] [2025-02-05 21:59:43,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:43,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:43,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:43,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:43,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:43,335 INFO L87 Difference]: Start difference. First operand 8465 states and 14308 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:59:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:43,980 INFO L93 Difference]: Finished difference Result 22369 states and 37770 transitions. [2025-02-05 21:59:43,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:43,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 732 [2025-02-05 21:59:43,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:44,060 INFO L225 Difference]: With dead ends: 22369 [2025-02-05 21:59:44,060 INFO L226 Difference]: Without dead ends: 13951 [2025-02-05 21:59:44,096 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-02-05 21:59:44,097 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 325 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:44,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1277 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:44,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13951 states. [2025-02-05 21:59:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13951 to 13937. [2025-02-05 21:59:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13937 states, 10748 states have (on average 1.6058801637513955) internal successors, (17260), 10801 states have internal predecessors, (17260), 3092 states have call successors, (3092), 96 states have call predecessors, (3092), 96 states have return successors, (3092), 3039 states have call predecessors, (3092), 3092 states have call successors, (3092) [2025-02-05 21:59:44,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13937 states to 13937 states and 23444 transitions. [2025-02-05 21:59:44,913 INFO L78 Accepts]: Start accepts. Automaton has 13937 states and 23444 transitions. Word has length 732 [2025-02-05 21:59:44,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:44,915 INFO L471 AbstractCegarLoop]: Abstraction has 13937 states and 23444 transitions. [2025-02-05 21:59:44,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:59:44,915 INFO L276 IsEmpty]: Start isEmpty. Operand 13937 states and 23444 transitions. [2025-02-05 21:59:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-02-05 21:59:44,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:44,933 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:44,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:59:44,933 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:44,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:44,934 INFO L85 PathProgramCache]: Analyzing trace with hash 552131631, now seen corresponding path program 1 times [2025-02-05 21:59:44,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:44,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124593015] [2025-02-05 21:59:44,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:44,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:44,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-02-05 21:59:45,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-02-05 21:59:45,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:45,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:45,248 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:59:45,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:45,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124593015] [2025-02-05 21:59:45,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124593015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:45,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:45,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:45,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362042215] [2025-02-05 21:59:45,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:45,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:45,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:45,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:45,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:45,250 INFO L87 Difference]: Start difference. First operand 13937 states and 23444 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:59:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:46,012 INFO L93 Difference]: Finished difference Result 41717 states and 70182 transitions. [2025-02-05 21:59:46,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:46,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 732 [2025-02-05 21:59:46,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:46,149 INFO L225 Difference]: With dead ends: 41717 [2025-02-05 21:59:46,149 INFO L226 Difference]: Without dead ends: 27827 [2025-02-05 21:59:46,187 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-02-05 21:59:46,188 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 392 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:46,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1198 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:46,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27827 states. [2025-02-05 21:59:48,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27827 to 27761. [2025-02-05 21:59:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27761 states, 21412 states have (on average 1.6022790958341118) internal successors, (34308), 21517 states have internal predecessors, (34308), 6156 states have call successors, (6156), 192 states have call predecessors, (6156), 192 states have return successors, (6156), 6051 states have call predecessors, (6156), 6156 states have call successors, (6156) [2025-02-05 21:59:48,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27761 states to 27761 states and 46620 transitions. [2025-02-05 21:59:48,247 INFO L78 Accepts]: Start accepts. Automaton has 27761 states and 46620 transitions. Word has length 732 [2025-02-05 21:59:48,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:48,248 INFO L471 AbstractCegarLoop]: Abstraction has 27761 states and 46620 transitions. [2025-02-05 21:59:48,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:59:48,249 INFO L276 IsEmpty]: Start isEmpty. Operand 27761 states and 46620 transitions. [2025-02-05 21:59:48,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-02-05 21:59:48,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:48,276 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:48,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:59:48,276 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:48,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:48,277 INFO L85 PathProgramCache]: Analyzing trace with hash -370551952, now seen corresponding path program 1 times [2025-02-05 21:59:48,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:48,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568700674] [2025-02-05 21:59:48,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:48,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:48,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-02-05 21:59:48,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-02-05 21:59:48,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:48,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:59:48,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:48,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568700674] [2025-02-05 21:59:48,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568700674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:48,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:48,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:59:48,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713530860] [2025-02-05 21:59:48,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:48,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:59:48,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:48,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:59:48,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:48,644 INFO L87 Difference]: Start difference. First operand 27761 states and 46620 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:59:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:51,449 INFO L93 Difference]: Finished difference Result 110775 states and 186063 transitions. [2025-02-05 21:59:51,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:59:51,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 732 [2025-02-05 21:59:51,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:51,752 INFO L225 Difference]: With dead ends: 110775 [2025-02-05 21:59:51,753 INFO L226 Difference]: Without dead ends: 83061 [2025-02-05 21:59:51,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:59:51,835 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 943 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:51,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 2002 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 21:59:51,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83061 states. [2025-02-05 21:59:57,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83061 to 83057. [2025-02-05 21:59:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83057 states, 64068 states have (on average 1.6008615845663983) internal successors, (102564), 64381 states have internal predecessors, (102564), 18412 states have call successors, (18412), 576 states have call predecessors, (18412), 576 states have return successors, (18412), 18099 states have call predecessors, (18412), 18412 states have call successors, (18412) [2025-02-05 21:59:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83057 states to 83057 states and 139388 transitions. [2025-02-05 21:59:57,637 INFO L78 Accepts]: Start accepts. Automaton has 83057 states and 139388 transitions. Word has length 732 [2025-02-05 21:59:57,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:57,638 INFO L471 AbstractCegarLoop]: Abstraction has 83057 states and 139388 transitions. [2025-02-05 21:59:57,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 21:59:57,638 INFO L276 IsEmpty]: Start isEmpty. Operand 83057 states and 139388 transitions. [2025-02-05 21:59:57,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-02-05 21:59:57,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:57,948 INFO L218 NwaCegarLoop]: trace histogram [116, 116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:57,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:59:57,948 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:57,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:57,949 INFO L85 PathProgramCache]: Analyzing trace with hash 168344464, now seen corresponding path program 1 times [2025-02-05 21:59:57,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:57,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925434124] [2025-02-05 21:59:57,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:57,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:57,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-02-05 21:59:58,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-02-05 21:59:58,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:58,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:58,779 INFO L134 CoverageAnalysis]: Checked inductivity of 26680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26680 trivial. 0 not checked. [2025-02-05 21:59:58,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:58,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925434124] [2025-02-05 21:59:58,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925434124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:58,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:58,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:58,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222303446] [2025-02-05 21:59:58,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:58,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:58,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:58,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:58,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:58,782 INFO L87 Difference]: Start difference. First operand 83057 states and 139388 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-05 22:00:04,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:04,826 INFO L93 Difference]: Finished difference Result 249005 states and 417870 transitions. [2025-02-05 22:00:04,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:00:04,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (116), 1 states have call predecessors, (116), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 732 [2025-02-05 22:00:04,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:05,601 INFO L225 Difference]: With dead ends: 249005 [2025-02-05 22:00:05,602 INFO L226 Difference]: Without dead ends: 165995 [2025-02-05 22:00:05,782 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-02-05 22:00:05,783 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 373 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:05,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1200 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:00:05,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165995 states.