./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stateful-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_stateful-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 16:12:52,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:12:52,286 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:12:52,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:12:52,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:12:52,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:12:52,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:12:52,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:12:52,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:12:52,318 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:12:52,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:12:52,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:12:52,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:12:52,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:12:52,321 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:12:52,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:12:52,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:12:52,322 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:12:52,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:12:52,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:12:52,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:12:52,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:12:52,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:12:52,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:12:52,327 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:12:52,327 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:12:52,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:12:52,328 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:12:52,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:12:52,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:12:52,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:12:52,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:12:52,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:12:52,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:12:52,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:12:52,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:12:52,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:12:52,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:12:52,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:12:52,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:12:52,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:12:52,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:12:52,333 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e [2024-11-08 16:12:52,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:12:52,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:12:52,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:12:52,642 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:12:52,642 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:12:52,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2024-11-08 16:12:54,145 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:12:54,164 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException 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) [2024-11-08 16:12:54,393 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:12:54,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2024-11-08 16:12:54,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0d36ca5/9f7ed6ec26164a4893346f5b234dfcf3/FLAGa76887770 [2024-11-08 16:12:54,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0d36ca5/9f7ed6ec26164a4893346f5b234dfcf3 [2024-11-08 16:12:54,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:12:54,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:12:54,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:12:54,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:12:54,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:12:54,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:12:54" (1/1) ... [2024-11-08 16:12:54,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f8f913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:12:54, skipping insertion in model container [2024-11-08 16:12:54,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:12:54" (1/1) ... [2024-11-08 16:12:54,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:12:54,786 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i[23400,23413] [2024-11-08 16:12:54,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:12:54,929 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:12:54,964 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i[23400,23413] [2024-11-08 16:12:55,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:12:55,047 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:12:55,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:12:55 WrapperNode [2024-11-08 16:12:55,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:12:55,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:12:55,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:12:55,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:12:55,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:12:55" (1/1) ... [2024-11-08 16:12:55,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:12:55" (1/1) ... [2024-11-08 16:12:55,153 INFO L138 Inliner]: procedures = 144, calls = 240, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 578 [2024-11-08 16:12:55,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:12:55,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:12:55,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:12:55,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:12:55,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:12:55" (1/1) ... [2024-11-08 16:12:55,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:12:55" (1/1) ... [2024-11-08 16:12:55,183 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:12:55" (1/1) ... [2024-11-08 16:12:55,220 INFO L175 MemorySlicer]: Split 120 memory accesses to 17 slices as follows [2, 8, 8, 4, 8, 7, 20, 12, 3, 10, 10, 3, 0, 12, 3, 3, 7]. 17 percent of accesses are in the largest equivalence class. The 31 initializations are split as follows [2, 3, 3, 0, 3, 0, 6, 6, 0, 2, 2, 0, 0, 4, 0, 0, 0]. The 37 writes are split as follows [0, 2, 2, 2, 2, 1, 8, 3, 1, 4, 4, 1, 0, 4, 1, 1, 1]. [2024-11-08 16:12:55,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:12:55" (1/1) ... [2024-11-08 16:12:55,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:12:55" (1/1) ... [2024-11-08 16:12:55,246 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:12:55" (1/1) ... [2024-11-08 16:12:55,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:12:55" (1/1) ... [2024-11-08 16:12:55,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:12:55" (1/1) ... [2024-11-08 16:12:55,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:12:55" (1/1) ... [2024-11-08 16:12:55,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:12:55,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:12:55,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:12:55,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:12:55,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:12:55" (1/1) ... [2024-11-08 16:12:55,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:12:55,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:12:55,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:12:55,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:12:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 16:12:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 16:12:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 16:12:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 16:12:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 16:12:55,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-08 16:12:55,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-08 16:12:55,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-08 16:12:55,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-08 16:12:55,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-08 16:12:55,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-08 16:12:55,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-08 16:12:55,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-08 16:12:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-08 16:12:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-08 16:12:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-08 16:12:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-11-08 16:12:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 16:12:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 16:12:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 16:12:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 16:12:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 16:12:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-08 16:12:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-08 16:12:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-08 16:12:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-08 16:12:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-08 16:12:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-08 16:12:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-08 16:12:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-08 16:12:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-08 16:12:55,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-08 16:12:55,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-08 16:12:55,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-11-08 16:12:55,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:12:55,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 16:12:55,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 16:12:55,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 16:12:55,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 16:12:55,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-08 16:12:55,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-08 16:12:55,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-08 16:12:55,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-08 16:12:55,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-08 16:12:55,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-08 16:12:55,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-08 16:12:55,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-08 16:12:55,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-08 16:12:55,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-08 16:12:55,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-08 16:12:55,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-11-08 16:12:55,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-11-08 16:12:55,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-11-08 16:12:55,391 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2024-11-08 16:12:55,391 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2024-11-08 16:12:55,391 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2024-11-08 16:12:55,391 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2024-11-08 16:12:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-11-08 16:12:55,428 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-11-08 16:12:55,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 16:12:55,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 16:12:55,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 16:12:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-08 16:12:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-08 16:12:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-08 16:12:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-08 16:12:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-08 16:12:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-08 16:12:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-08 16:12:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-08 16:12:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-08 16:12:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-08 16:12:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-08 16:12:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-11-08 16:12:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-11-08 16:12:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-11-08 16:12:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-11-08 16:12:55,430 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-11-08 16:12:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-08 16:12:55,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-08 16:12:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 16:12:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 16:12:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 16:12:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 16:12:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-08 16:12:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-08 16:12:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-08 16:12:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-08 16:12:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-08 16:12:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-08 16:12:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-08 16:12:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-08 16:12:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-11-08 16:12:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-11-08 16:12:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-11-08 16:12:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-11-08 16:12:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-11-08 16:12:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-11-08 16:12:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-11-08 16:12:55,433 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-11-08 16:12:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:12:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 16:12:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 16:12:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 16:12:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 16:12:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 16:12:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-08 16:12:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-08 16:12:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-08 16:12:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-08 16:12:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-08 16:12:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-08 16:12:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-08 16:12:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-08 16:12:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-08 16:12:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-08 16:12:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-08 16:12:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2024-11-08 16:12:55,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2024-11-08 16:12:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:12:55,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:12:55,718 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:12:55,719 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:12:56,113 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: SUMMARY for call __CS_cs(); srcloc: null [2024-11-08 16:12:56,114 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2024-11-08 16:12:56,114 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-08 16:12:56,114 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-08 16:12:56,114 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2024-11-08 16:12:56,114 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-08 16:12:56,114 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2024-11-08 16:13:00,453 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-08 16:13:00,454 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:13:00,478 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:13:00,479 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 16:13:00,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:13:00 BoogieIcfgContainer [2024-11-08 16:13:00,479 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:13:00,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:13:00,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:13:00,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:13:00,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:12:54" (1/3) ... [2024-11-08 16:13:00,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4445aa7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:13:00, skipping insertion in model container [2024-11-08 16:13:00,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:12:55" (2/3) ... [2024-11-08 16:13:00,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4445aa7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:13:00, skipping insertion in model container [2024-11-08 16:13:00,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:13:00" (3/3) ... [2024-11-08 16:13:00,488 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_stateful-1.i [2024-11-08 16:13:00,506 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:13:00,507 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:13:00,580 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:13:00,586 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;@3974cf30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:13:00,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:13:00,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 170 states, 119 states have (on average 1.504201680672269) internal successors, (179), 120 states have internal predecessors, (179), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:13:00,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 16:13:00,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:13:00,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:13:00,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:13:00,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:13:00,613 INFO L85 PathProgramCache]: Analyzing trace with hash 311592103, now seen corresponding path program 1 times [2024-11-08 16:13:00,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:13:00,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036672713] [2024-11-08 16:13:00,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:00,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:13:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:13:01,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:13:01,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036672713] [2024-11-08 16:13:01,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036672713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:13:01,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:13:01,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:13:01,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12875409] [2024-11-08 16:13:01,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:13:01,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:13:01,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:13:01,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:13:01,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:13:01,239 INFO L87 Difference]: Start difference. First operand has 170 states, 119 states have (on average 1.504201680672269) internal successors, (179), 120 states have internal predecessors, (179), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:13:02,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:13:02,048 INFO L93 Difference]: Finished difference Result 343 states and 563 transitions. [2024-11-08 16:13:02,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:13:02,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-08 16:13:02,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:13:02,064 INFO L225 Difference]: With dead ends: 343 [2024-11-08 16:13:02,064 INFO L226 Difference]: Without dead ends: 171 [2024-11-08 16:13:02,075 INFO L431 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 [2024-11-08 16:13:02,078 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 5 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:13:02,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 484 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:13:02,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-08 16:13:02,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2024-11-08 16:13:02,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 117 states have (on average 1.376068376068376) internal successors, (161), 117 states have internal predecessors, (161), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:13:02,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 245 transitions. [2024-11-08 16:13:02,138 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 245 transitions. Word has length 32 [2024-11-08 16:13:02,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:13:02,139 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 245 transitions. [2024-11-08 16:13:02,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:13:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2024-11-08 16:13:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 16:13:02,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:13:02,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:13:02,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:13:02,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:13:02,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:13:02,144 INFO L85 PathProgramCache]: Analyzing trace with hash -559855331, now seen corresponding path program 1 times [2024-11-08 16:13:02,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:13:02,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089745622] [2024-11-08 16:13:02,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:02,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:13:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:13:02,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:13:02,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089745622] [2024-11-08 16:13:02,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089745622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:13:02,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:13:02,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:13:02,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768829749] [2024-11-08 16:13:02,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:13:02,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:13:02,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:13:02,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:13:02,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:13:02,395 INFO L87 Difference]: Start difference. First operand 167 states and 245 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:13:02,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:13:02,452 INFO L93 Difference]: Finished difference Result 333 states and 490 transitions. [2024-11-08 16:13:02,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:13:02,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-08 16:13:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:13:02,457 INFO L225 Difference]: With dead ends: 333 [2024-11-08 16:13:02,457 INFO L226 Difference]: Without dead ends: 169 [2024-11-08 16:13:02,458 INFO L431 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 [2024-11-08 16:13:02,459 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 1 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:13:02,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 480 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:13:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-08 16:13:02,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2024-11-08 16:13:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 118 states have (on average 1.3728813559322033) internal successors, (162), 118 states have internal predecessors, (162), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:13:02,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 246 transitions. [2024-11-08 16:13:02,494 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 246 transitions. Word has length 36 [2024-11-08 16:13:02,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:13:02,494 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 246 transitions. [2024-11-08 16:13:02,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:13:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 246 transitions. [2024-11-08 16:13:02,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 16:13:02,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:13:02,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:13:02,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:13:02,501 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:13:02,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:13:02,502 INFO L85 PathProgramCache]: Analyzing trace with hash -597667749, now seen corresponding path program 1 times [2024-11-08 16:13:02,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:13:02,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074138457] [2024-11-08 16:13:02,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:02,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:13:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:13:02,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:13:02,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074138457] [2024-11-08 16:13:02,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074138457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:13:02,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500467030] [2024-11-08 16:13:02,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:02,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:13:02,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:13:02,733 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:13:02,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:13:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:03,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:13:03,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:13:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:13:03,136 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:13:03,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:13:03,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500467030] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:13:03,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:13:03,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-08 16:13:03,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568061671] [2024-11-08 16:13:03,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:13:03,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:13:03,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:13:03,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:13:03,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:13:03,180 INFO L87 Difference]: Start difference. First operand 168 states and 246 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:13:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:13:03,251 INFO L93 Difference]: Finished difference Result 337 states and 495 transitions. [2024-11-08 16:13:03,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:13:03,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-08 16:13:03,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:13:03,256 INFO L225 Difference]: With dead ends: 337 [2024-11-08 16:13:03,256 INFO L226 Difference]: Without dead ends: 172 [2024-11-08 16:13:03,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:13:03,258 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 1 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:13:03,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 718 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:13:03,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-08 16:13:03,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-11-08 16:13:03,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 122 states have (on average 1.360655737704918) internal successors, (166), 122 states have internal predecessors, (166), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:13:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 250 transitions. [2024-11-08 16:13:03,273 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 250 transitions. Word has length 38 [2024-11-08 16:13:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:13:03,273 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 250 transitions. [2024-11-08 16:13:03,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:13:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 250 transitions. [2024-11-08 16:13:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 16:13:03,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:13:03,276 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:13:03,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 16:13:03,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:13:03,477 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:13:03,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:13:03,478 INFO L85 PathProgramCache]: Analyzing trace with hash -758663081, now seen corresponding path program 2 times [2024-11-08 16:13:03,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:13:03,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698057712] [2024-11-08 16:13:03,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:03,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:13:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 16:13:03,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:13:03,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698057712] [2024-11-08 16:13:03,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698057712] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:13:03,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165273553] [2024-11-08 16:13:03,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 16:13:03,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:13:03,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:13:03,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:13:03,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 16:13:04,020 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 16:13:04,020 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:13:04,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:13:04,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:13:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 16:13:04,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:13:04,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165273553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:13:04,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:13:04,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 16:13:04,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287158431] [2024-11-08 16:13:04,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:13:04,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:13:04,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:13:04,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:13:04,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:13:04,117 INFO L87 Difference]: Start difference. First operand 172 states and 250 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:13:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:13:04,172 INFO L93 Difference]: Finished difference Result 328 states and 489 transitions. [2024-11-08 16:13:04,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:13:04,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-08 16:13:04,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:13:04,180 INFO L225 Difference]: With dead ends: 328 [2024-11-08 16:13:04,180 INFO L226 Difference]: Without dead ends: 302 [2024-11-08 16:13:04,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:13:04,182 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 203 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:13:04,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 872 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:13:04,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-08 16:13:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2024-11-08 16:13:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 203 states have (on average 1.4088669950738917) internal successors, (286), 203 states have internal predecessors, (286), 83 states have call successors, (83), 14 states have call predecessors, (83), 14 states have return successors, (91), 83 states have call predecessors, (91), 83 states have call successors, (91) [2024-11-08 16:13:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 460 transitions. [2024-11-08 16:13:04,228 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 460 transitions. Word has length 42 [2024-11-08 16:13:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:13:04,228 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 460 transitions. [2024-11-08 16:13:04,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:13:04,228 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 460 transitions. [2024-11-08 16:13:04,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 16:13:04,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:13:04,233 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:13:04,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 16:13:04,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 16:13:04,434 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:13:04,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:13:04,435 INFO L85 PathProgramCache]: Analyzing trace with hash -483239629, now seen corresponding path program 1 times [2024-11-08 16:13:04,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:13:04,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138774014] [2024-11-08 16:13:04,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:04,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:13:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:04,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 16:13:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:04,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 16:13:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:04,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:13:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:04,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:13:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:04,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:13:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:04,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 16:13:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:04,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 16:13:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-08 16:13:04,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:13:04,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138774014] [2024-11-08 16:13:04,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138774014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:13:04,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684377694] [2024-11-08 16:13:04,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:04,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:13:04,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:13:04,974 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:13:04,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 16:13:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:05,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:13:05,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:13:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-08 16:13:05,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:13:05,523 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-08 16:13:05,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684377694] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:13:05,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:13:05,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2024-11-08 16:13:05,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079116731] [2024-11-08 16:13:05,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:13:05,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:13:05,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:13:05,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:13:05,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:13:05,527 INFO L87 Difference]: Start difference. First operand 301 states and 460 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 16:13:06,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:13:09,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:13:10,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:13:10,471 INFO L93 Difference]: Finished difference Result 609 states and 938 transitions. [2024-11-08 16:13:10,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:13:10,472 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2024-11-08 16:13:10,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:13:10,477 INFO L225 Difference]: With dead ends: 609 [2024-11-08 16:13:10,479 INFO L226 Difference]: Without dead ends: 321 [2024-11-08 16:13:10,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 191 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:13:10,483 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 58 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:13:10,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 681 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-08 16:13:10,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-08 16:13:10,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 315. [2024-11-08 16:13:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 215 states have (on average 1.3906976744186046) internal successors, (299), 217 states have internal predecessors, (299), 83 states have call successors, (83), 14 states have call predecessors, (83), 16 states have return successors, (97), 83 states have call predecessors, (97), 83 states have call successors, (97) [2024-11-08 16:13:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 479 transitions. [2024-11-08 16:13:10,530 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 479 transitions. Word has length 92 [2024-11-08 16:13:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:13:10,530 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 479 transitions. [2024-11-08 16:13:10,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-08 16:13:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 479 transitions. [2024-11-08 16:13:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 16:13:10,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:13:10,535 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:13:10,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 16:13:10,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:13:10,739 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:13:10,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:13:10,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2101212085, now seen corresponding path program 2 times [2024-11-08 16:13:10,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:13:10,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440695067] [2024-11-08 16:13:10,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:10,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:13:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:11,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:13:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:11,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 16:13:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:11,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:13:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:11,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:13:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:11,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:13:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:11,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 16:13:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:11,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 16:13:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-08 16:13:11,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:13:11,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440695067] [2024-11-08 16:13:11,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440695067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:13:11,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:13:11,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:13:11,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120095291] [2024-11-08 16:13:11,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:13:11,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:13:11,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:13:11,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:13:11,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:13:11,589 INFO L87 Difference]: Start difference. First operand 315 states and 479 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 16:13:13,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:13:13,309 INFO L93 Difference]: Finished difference Result 883 states and 1373 transitions. [2024-11-08 16:13:13,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:13:13,309 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 102 [2024-11-08 16:13:13,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:13:13,317 INFO L225 Difference]: With dead ends: 883 [2024-11-08 16:13:13,318 INFO L226 Difference]: Without dead ends: 608 [2024-11-08 16:13:13,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:13:13,321 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 313 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:13:13,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 878 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 16:13:13,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-08 16:13:13,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 572. [2024-11-08 16:13:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 376 states have (on average 1.425531914893617) internal successors, (536), 379 states have internal predecessors, (536), 163 states have call successors, (163), 28 states have call predecessors, (163), 32 states have return successors, (198), 164 states have call predecessors, (198), 163 states have call successors, (198) [2024-11-08 16:13:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 897 transitions. [2024-11-08 16:13:13,389 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 897 transitions. Word has length 102 [2024-11-08 16:13:13,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:13:13,391 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 897 transitions. [2024-11-08 16:13:13,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 16:13:13,391 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 897 transitions. [2024-11-08 16:13:13,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 16:13:13,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:13:13,396 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:13:13,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:13:13,397 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:13:13,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:13:13,397 INFO L85 PathProgramCache]: Analyzing trace with hash 8857877, now seen corresponding path program 1 times [2024-11-08 16:13:13,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:13:13,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059431534] [2024-11-08 16:13:13,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:13,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:13:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:13,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:13:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:14,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 16:13:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:14,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:13:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:14,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:13:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:14,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:13:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:14,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 16:13:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:14,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 16:13:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-08 16:13:14,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:13:14,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059431534] [2024-11-08 16:13:14,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059431534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:13:14,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:13:14,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:13:14,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293555050] [2024-11-08 16:13:14,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:13:14,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:13:14,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:13:14,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:13:14,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:13:14,077 INFO L87 Difference]: Start difference. First operand 572 states and 897 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 16:13:16,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:13:16,211 INFO L93 Difference]: Finished difference Result 1081 states and 1677 transitions. [2024-11-08 16:13:16,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:13:16,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 102 [2024-11-08 16:13:16,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:13:16,216 INFO L225 Difference]: With dead ends: 1081 [2024-11-08 16:13:16,217 INFO L226 Difference]: Without dead ends: 535 [2024-11-08 16:13:16,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:13:16,220 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 309 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:13:16,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 879 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 16:13:16,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-08 16:13:16,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 499. [2024-11-08 16:13:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 333 states have (on average 1.3423423423423424) internal successors, (447), 335 states have internal predecessors, (447), 136 states have call successors, (136), 25 states have call predecessors, (136), 29 states have return successors, (160), 138 states have call predecessors, (160), 136 states have call successors, (160) [2024-11-08 16:13:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 743 transitions. [2024-11-08 16:13:16,292 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 743 transitions. Word has length 102 [2024-11-08 16:13:16,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:13:16,292 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 743 transitions. [2024-11-08 16:13:16,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 16:13:16,293 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 743 transitions. [2024-11-08 16:13:16,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 16:13:16,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:13:16,295 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:13:16,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:13:16,295 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:13:16,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:13:16,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2145900149, now seen corresponding path program 1 times [2024-11-08 16:13:16,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:13:16,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049095300] [2024-11-08 16:13:16,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:16,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:13:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:17,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 16:13:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:17,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 16:13:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:17,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:13:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:17,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:13:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:17,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:13:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:17,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 16:13:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:17,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 16:13:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-08 16:13:17,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:13:17,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049095300] [2024-11-08 16:13:17,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049095300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:13:17,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230919796] [2024-11-08 16:13:17,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:17,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:13:17,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:13:17,890 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:13:17,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 16:13:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:18,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 16:13:18,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:13:18,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 16:13:18,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 16:13:18,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 16:13:18,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 16:13:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-08 16:13:18,587 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:13:18,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230919796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:13:18,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:13:18,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-08 16:13:18,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875680435] [2024-11-08 16:13:18,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:13:18,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:13:18,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:13:18,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:13:18,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:13:18,590 INFO L87 Difference]: Start difference. First operand 499 states and 743 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 16:13:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:13:19,138 INFO L93 Difference]: Finished difference Result 562 states and 808 transitions. [2024-11-08 16:13:19,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:13:19,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 102 [2024-11-08 16:13:19,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:13:19,142 INFO L225 Difference]: With dead ends: 562 [2024-11-08 16:13:19,142 INFO L226 Difference]: Without dead ends: 442 [2024-11-08 16:13:19,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:13:19,144 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 244 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:13:19,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 957 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:13:19,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-08 16:13:19,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 418. [2024-11-08 16:13:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 287 states have (on average 1.348432055749129) internal successors, (387), 290 states have internal predecessors, (387), 104 states have call successors, (104), 21 states have call predecessors, (104), 26 states have return successors, (129), 106 states have call predecessors, (129), 104 states have call successors, (129) [2024-11-08 16:13:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 620 transitions. [2024-11-08 16:13:19,186 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 620 transitions. Word has length 102 [2024-11-08 16:13:19,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:13:19,188 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 620 transitions. [2024-11-08 16:13:19,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 16:13:19,188 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 620 transitions. [2024-11-08 16:13:19,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:13:19,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:13:19,191 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:13:19,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 16:13:19,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:13:19,396 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:13:19,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:13:19,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1482994823, now seen corresponding path program 1 times [2024-11-08 16:13:19,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:13:19,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243932536] [2024-11-08 16:13:19,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:19,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:13:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:20,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 16:13:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:20,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 16:13:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:20,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 16:13:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:20,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 16:13:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:20,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:13:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:20,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 16:13:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:20,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 16:13:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:20,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 16:13:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:20,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:13:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:20,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:13:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:20,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 16:13:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:20,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 16:13:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:20,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 16:13:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:20,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 16:13:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:20,527 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-08 16:13:20,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:13:20,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243932536] [2024-11-08 16:13:20,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243932536] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:13:20,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659827289] [2024-11-08 16:13:20,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:20,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:13:20,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:13:20,530 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:13:20,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 16:13:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:21,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 1409 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 16:13:21,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:13:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2024-11-08 16:13:21,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:13:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2024-11-08 16:13:21,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659827289] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:13:21,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:13:21,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 16 [2024-11-08 16:13:21,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122581432] [2024-11-08 16:13:21,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:13:21,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 16:13:21,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:13:21,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 16:13:21,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:13:21,612 INFO L87 Difference]: Start difference. First operand 418 states and 620 transitions. Second operand has 16 states, 16 states have (on average 6.5625) internal successors, (105), 12 states have internal predecessors, (105), 7 states have call successors, (35), 7 states have call predecessors, (35), 6 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) [2024-11-08 16:13:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:13:25,400 INFO L93 Difference]: Finished difference Result 1062 states and 1624 transitions. [2024-11-08 16:13:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 16:13:25,401 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.5625) internal successors, (105), 12 states have internal predecessors, (105), 7 states have call successors, (35), 7 states have call predecessors, (35), 6 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) Word has length 145 [2024-11-08 16:13:25,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:13:25,407 INFO L225 Difference]: With dead ends: 1062 [2024-11-08 16:13:25,407 INFO L226 Difference]: Without dead ends: 690 [2024-11-08 16:13:25,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2024-11-08 16:13:25,411 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 505 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:13:25,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 1286 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 16:13:25,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-08 16:13:25,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 639. [2024-11-08 16:13:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 422 states have (on average 1.3767772511848342) internal successors, (581), 429 states have internal predecessors, (581), 174 states have call successors, (174), 36 states have call predecessors, (174), 42 states have return successors, (218), 173 states have call predecessors, (218), 174 states have call successors, (218) [2024-11-08 16:13:25,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 973 transitions. [2024-11-08 16:13:25,496 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 973 transitions. Word has length 145 [2024-11-08 16:13:25,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:13:25,496 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 973 transitions. [2024-11-08 16:13:25,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.5625) internal successors, (105), 12 states have internal predecessors, (105), 7 states have call successors, (35), 7 states have call predecessors, (35), 6 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) [2024-11-08 16:13:25,497 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 973 transitions. [2024-11-08 16:13:25,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:13:25,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:13:25,500 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:13:25,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 16:13:25,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:13:25,701 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:13:25,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:13:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash 101692697, now seen corresponding path program 1 times [2024-11-08 16:13:25,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:13:25,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971942841] [2024-11-08 16:13:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:25,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:13:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:27,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 16:13:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:28,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 16:13:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:28,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 16:13:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:28,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 16:13:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:28,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:13:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:28,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 16:13:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:28,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 16:13:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:28,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 16:13:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:28,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:13:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:28,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:13:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:28,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 16:13:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:28,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 16:13:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:28,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 16:13:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:28,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 16:13:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-08 16:13:28,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:13:28,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971942841] [2024-11-08 16:13:28,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971942841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:13:28,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586651695] [2024-11-08 16:13:28,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:13:28,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:13:28,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:13:28,681 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:13:28,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 16:13:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:13:29,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 1507 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-08 16:13:29,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:13:29,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 16:13:29,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:13:29,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:13:29,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2024-11-08 16:13:29,835 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-08 16:13:29,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-08 16:14:01,532 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 85 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-08 16:14:01,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:14:01,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2024-11-08 16:14:01,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2024-11-08 16:14:02,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-08 16:14:02,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2024-11-08 16:14:02,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-08 16:14:02,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2024-11-08 16:14:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2024-11-08 16:14:02,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586651695] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:14:02,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:14:02,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 9] total 39 [2024-11-08 16:14:02,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726125869] [2024-11-08 16:14:02,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:14:02,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-08 16:14:02,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:14:02,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-08 16:14:02,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1337, Unknown=2, NotChecked=0, Total=1482 [2024-11-08 16:14:02,437 INFO L87 Difference]: Start difference. First operand 639 states and 973 transitions. Second operand has 39 states, 36 states have (on average 4.527777777777778) internal successors, (163), 35 states have internal predecessors, (163), 13 states have call successors, (42), 12 states have call predecessors, (42), 13 states have return successors, (42), 12 states have call predecessors, (42), 13 states have call successors, (42) [2024-11-08 16:14:03,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:14:05,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:14:08,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:14:14,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []