./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 bd259ad1e1e9b7f6e2ebd2858541cc7ac07d30ed5cbee2b9de70c1db1c5b700e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:34:28,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:34:28,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 16:34:28,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:34:28,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:34:28,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:34:28,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:34:28,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:34:28,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:34:28,329 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:34:28,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:34:28,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:34:28,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:34:28,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:34:28,331 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:34:28,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:34:28,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:34:28,332 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:34:28,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:34:28,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:34:28,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:34:28,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:34:28,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:34:28,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:34:28,334 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:34:28,334 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:34:28,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:34:28,335 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:34:28,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:34:28,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:34:28,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:34:28,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:34:28,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:34:28,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:34:28,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:34:28,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:34:28,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:34:28,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:34:28,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:34:28,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:34:28,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:34:28,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:34:28,339 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-clean/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-clean/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 -> bd259ad1e1e9b7f6e2ebd2858541cc7ac07d30ed5cbee2b9de70c1db1c5b700e [2024-10-11 16:34:28,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:34:28,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:34:28,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:34:28,543 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:34:28,543 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:34:28,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i [2024-10-11 16:34:29,836 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:34:30,335 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:34:30,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i [2024-10-11 16:34:30,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/246ea6a12/f0483b783c0940678f2837f02c2f7300/FLAG2ce773ff0 [2024-10-11 16:34:30,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/246ea6a12/f0483b783c0940678f2837f02c2f7300 [2024-10-11 16:34:30,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:34:30,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:34:30,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:34:30,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:34:30,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:34:30,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:34:30" (1/1) ... [2024-10-11 16:34:30,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3efb074e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:30, skipping insertion in model container [2024-10-11 16:34:30,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:34:30" (1/1) ... [2024-10-11 16:34:30,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:34:30,872 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i[33021,33034] [2024-10-11 16:34:31,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:34:31,010 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:34:31,030 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i[33021,33034] [2024-10-11 16:34:31,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:34:31,108 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:34:31,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:31 WrapperNode [2024-10-11 16:34:31,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:34:31,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:34:31,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:34:31,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:34:31,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:31" (1/1) ... [2024-10-11 16:34:31,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:31" (1/1) ... [2024-10-11 16:34:31,195 INFO L138 Inliner]: procedures = 176, calls = 434, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1901 [2024-10-11 16:34:31,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:34:31,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:34:31,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:34:31,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:34:31,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:31" (1/1) ... [2024-10-11 16:34:31,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:31" (1/1) ... [2024-10-11 16:34:31,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:31" (1/1) ... [2024-10-11 16:34:31,303 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-10-11 16:34:31,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:31" (1/1) ... [2024-10-11 16:34:31,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:31" (1/1) ... [2024-10-11 16:34:31,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:31" (1/1) ... [2024-10-11 16:34:31,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:31" (1/1) ... [2024-10-11 16:34:31,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:31" (1/1) ... [2024-10-11 16:34:31,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:31" (1/1) ... [2024-10-11 16:34:31,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:34:31,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:34:31,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:34:31,363 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:34:31,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:31" (1/1) ... [2024-10-11 16:34:31,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:34:31,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:34:31,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 16:34:31,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 16:34:31,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:34:31,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:34:31,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 16:34:31,422 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 16:34:31,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:34:31,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:34:31,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:34:31,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:34:31,423 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:34:31,423 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:34:31,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:34:31,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:34:31,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:34:31,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:34:31,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:34:31,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:34:31,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:34:31,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:34:31,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:34:31,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:34:31,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:34:31,636 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:34:31,638 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:34:33,014 INFO L? ?]: Removed 430 outVars from TransFormulas that were not future-live. [2024-10-11 16:34:33,014 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:34:33,046 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:34:33,047 INFO L314 CfgBuilder]: Removed 77 assume(true) statements. [2024-10-11 16:34:33,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:34:33 BoogieIcfgContainer [2024-10-11 16:34:33,047 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:34:33,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:34:33,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:34:33,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:34:33,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:34:30" (1/3) ... [2024-10-11 16:34:33,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689f2e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:34:33, skipping insertion in model container [2024-10-11 16:34:33,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:34:31" (2/3) ... [2024-10-11 16:34:33,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689f2e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:34:33, skipping insertion in model container [2024-10-11 16:34:33,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:34:33" (3/3) ... [2024-10-11 16:34:33,054 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-3.i [2024-10-11 16:34:33,066 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:34:33,066 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 16:34:33,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:34:33,127 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;@4d951781, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:34:33,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 16:34:33,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 480 states, 460 states have (on average 1.6304347826086956) internal successors, (750), 471 states have internal predecessors, (750), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 16:34:33,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 16:34:33,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:33,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:34:33,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:33,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:33,142 INFO L85 PathProgramCache]: Analyzing trace with hash 601310474, now seen corresponding path program 1 times [2024-10-11 16:34:33,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:33,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644235903] [2024-10-11 16:34:33,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:33,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:33,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:34:33,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:33,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644235903] [2024-10-11 16:34:33,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644235903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:34:33,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:34:33,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:34:33,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088273242] [2024-10-11 16:34:33,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:34:33,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:34:33,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:33,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:34:33,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:34:33,301 INFO L87 Difference]: Start difference. First operand has 480 states, 460 states have (on average 1.6304347826086956) internal successors, (750), 471 states have internal predecessors, (750), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:34:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:33,386 INFO L93 Difference]: Finished difference Result 1343 states and 2198 transitions. [2024-10-11 16:34:33,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:34:33,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 16:34:33,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:33,408 INFO L225 Difference]: With dead ends: 1343 [2024-10-11 16:34:33,408 INFO L226 Difference]: Without dead ends: 801 [2024-10-11 16:34:33,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-11 16:34:33,415 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 545 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:33,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:34:33,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-10-11 16:34:33,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 418. [2024-10-11 16:34:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 399 states have (on average 1.4536340852130325) internal successors, (580), 409 states have internal predecessors, (580), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 16:34:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 612 transitions. [2024-10-11 16:34:33,466 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 612 transitions. Word has length 9 [2024-10-11 16:34:33,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:33,466 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 612 transitions. [2024-10-11 16:34:33,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:34:33,467 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 612 transitions. [2024-10-11 16:34:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 16:34:33,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:33,472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 16:34:33,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:34:33,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:33,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:33,473 INFO L85 PathProgramCache]: Analyzing trace with hash 785719331, now seen corresponding path program 1 times [2024-10-11 16:34:33,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:33,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843240455] [2024-10-11 16:34:33,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:33,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:34:34,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:34,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843240455] [2024-10-11 16:34:34,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843240455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:34:34,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:34:34,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:34:34,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069483952] [2024-10-11 16:34:34,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:34:34,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:34:34,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:34,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:34:34,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:34:34,023 INFO L87 Difference]: Start difference. First operand 418 states and 612 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:34:34,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:34,124 INFO L93 Difference]: Finished difference Result 837 states and 1225 transitions. [2024-10-11 16:34:34,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:34:34,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2024-10-11 16:34:34,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:34,126 INFO L225 Difference]: With dead ends: 837 [2024-10-11 16:34:34,126 INFO L226 Difference]: Without dead ends: 421 [2024-10-11 16:34:34,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:34:34,128 INFO L432 NwaCegarLoop]: 580 mSDtfsCounter, 105 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:34,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1649 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:34:34,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-11 16:34:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 418. [2024-10-11 16:34:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 399 states have (on average 1.4360902255639099) internal successors, (573), 409 states have internal predecessors, (573), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 16:34:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 605 transitions. [2024-10-11 16:34:34,142 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 605 transitions. Word has length 155 [2024-10-11 16:34:34,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:34,143 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 605 transitions. [2024-10-11 16:34:34,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:34:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 605 transitions. [2024-10-11 16:34:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 16:34:34,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:34,145 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 16:34:34,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:34:34,146 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:34,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:34,146 INFO L85 PathProgramCache]: Analyzing trace with hash 212652439, now seen corresponding path program 1 times [2024-10-11 16:34:34,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:34,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811781217] [2024-10-11 16:34:34,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:34,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:34:34,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:34,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811781217] [2024-10-11 16:34:34,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811781217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:34:34,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:34:34,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:34:34,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143893704] [2024-10-11 16:34:34,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:34:34,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:34:34,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:34,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:34:34,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:34:34,324 INFO L87 Difference]: Start difference. First operand 418 states and 605 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:34:34,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:34,368 INFO L93 Difference]: Finished difference Result 963 states and 1397 transitions. [2024-10-11 16:34:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:34:34,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2024-10-11 16:34:34,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:34,371 INFO L225 Difference]: With dead ends: 963 [2024-10-11 16:34:34,372 INFO L226 Difference]: Without dead ends: 547 [2024-10-11 16:34:34,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-11 16:34:34,373 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 134 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:34,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1194 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:34:34,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-11 16:34:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2024-10-11 16:34:34,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 528 states have (on average 1.441287878787879) internal successors, (761), 538 states have internal predecessors, (761), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 16:34:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 793 transitions. [2024-10-11 16:34:34,389 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 793 transitions. Word has length 155 [2024-10-11 16:34:34,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:34,390 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 793 transitions. [2024-10-11 16:34:34,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:34:34,390 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 793 transitions. [2024-10-11 16:34:34,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 16:34:34,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:34,392 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 16:34:34,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:34:34,393 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:34,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:34,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1554308104, now seen corresponding path program 1 times [2024-10-11 16:34:34,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:34,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748970932] [2024-10-11 16:34:34,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:34,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:34,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:34:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:34,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:34:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:34,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:34:34,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:34,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748970932] [2024-10-11 16:34:34,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748970932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:34:34,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:34:34,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:34:34,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984101741] [2024-10-11 16:34:34,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:34:34,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:34:34,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:34,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:34:34,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:34:34,731 INFO L87 Difference]: Start difference. First operand 547 states and 793 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:34:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:35,121 INFO L93 Difference]: Finished difference Result 923 states and 1338 transitions. [2024-10-11 16:34:35,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:34:35,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2024-10-11 16:34:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:35,124 INFO L225 Difference]: With dead ends: 923 [2024-10-11 16:34:35,124 INFO L226 Difference]: Without dead ends: 507 [2024-10-11 16:34:35,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:34:35,129 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 43 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:35,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1818 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:34:35,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-10-11 16:34:35,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 505. [2024-10-11 16:34:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 486 states have (on average 1.4074074074074074) internal successors, (684), 496 states have internal predecessors, (684), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 16:34:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 716 transitions. [2024-10-11 16:34:35,147 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 716 transitions. Word has length 168 [2024-10-11 16:34:35,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:35,149 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 716 transitions. [2024-10-11 16:34:35,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:34:35,150 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 716 transitions. [2024-10-11 16:34:35,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 16:34:35,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:35,151 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 16:34:35,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:34:35,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:35,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:35,152 INFO L85 PathProgramCache]: Analyzing trace with hash 992416524, now seen corresponding path program 1 times [2024-10-11 16:34:35,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:35,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811649210] [2024-10-11 16:34:35,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:35,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:35,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:34:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:35,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:34:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:34:35,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:35,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811649210] [2024-10-11 16:34:35,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811649210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:34:35,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:34:35,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:34:35,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236227589] [2024-10-11 16:34:35,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:34:35,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:34:35,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:35,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:34:35,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:34:35,447 INFO L87 Difference]: Start difference. First operand 505 states and 716 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:34:35,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:35,747 INFO L93 Difference]: Finished difference Result 875 states and 1244 transitions. [2024-10-11 16:34:35,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:34:35,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2024-10-11 16:34:35,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:35,750 INFO L225 Difference]: With dead ends: 875 [2024-10-11 16:34:35,751 INFO L226 Difference]: Without dead ends: 501 [2024-10-11 16:34:35,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:34:35,752 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 16 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:35,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1825 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:34:35,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-10-11 16:34:35,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 499. [2024-10-11 16:34:35,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 480 states have (on average 1.4041666666666666) internal successors, (674), 490 states have internal predecessors, (674), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 16:34:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 706 transitions. [2024-10-11 16:34:35,761 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 706 transitions. Word has length 168 [2024-10-11 16:34:35,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:35,761 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 706 transitions. [2024-10-11 16:34:35,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:34:35,762 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 706 transitions. [2024-10-11 16:34:35,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 16:34:35,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:35,763 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 16:34:35,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:34:35,764 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:35,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:35,764 INFO L85 PathProgramCache]: Analyzing trace with hash 117406724, now seen corresponding path program 1 times [2024-10-11 16:34:35,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:35,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086627466] [2024-10-11 16:34:35,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:35,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:35,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:34:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:35,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:34:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:35,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:34:35,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:35,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086627466] [2024-10-11 16:34:35,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086627466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:34:35,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:34:35,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:34:35,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090704047] [2024-10-11 16:34:35,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:34:35,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:34:35,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:35,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:34:35,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:34:35,966 INFO L87 Difference]: Start difference. First operand 499 states and 706 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:34:36,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:36,272 INFO L93 Difference]: Finished difference Result 1009 states and 1421 transitions. [2024-10-11 16:34:36,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:34:36,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2024-10-11 16:34:36,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:36,275 INFO L225 Difference]: With dead ends: 1009 [2024-10-11 16:34:36,275 INFO L226 Difference]: Without dead ends: 641 [2024-10-11 16:34:36,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:34:36,280 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 246 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:36,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1395 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:34:36,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-10-11 16:34:36,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 639. [2024-10-11 16:34:36,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 617 states have (on average 1.385737439222042) internal successors, (855), 627 states have internal predecessors, (855), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 16:34:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 893 transitions. [2024-10-11 16:34:36,298 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 893 transitions. Word has length 168 [2024-10-11 16:34:36,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:36,299 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 893 transitions. [2024-10-11 16:34:36,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:34:36,299 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 893 transitions. [2024-10-11 16:34:36,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 16:34:36,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:36,301 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 16:34:36,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:34:36,302 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:36,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:36,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1123731777, now seen corresponding path program 1 times [2024-10-11 16:34:36,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:36,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553434129] [2024-10-11 16:34:36,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:36,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:36,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:34:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:36,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:34:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:36,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 16:34:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:36,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 16:34:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:34:36,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:36,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553434129] [2024-10-11 16:34:36,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553434129] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:34:36,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151986422] [2024-10-11 16:34:36,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:36,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:34:36,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:34:36,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:34:36,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 16:34:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:37,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 16:34:37,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:34:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:34:37,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:34:37,500 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:34:37,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151986422] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:34:37,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:34:37,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-10-11 16:34:37,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294653993] [2024-10-11 16:34:37,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:34:37,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:34:37,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:37,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:34:37,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:34:37,503 INFO L87 Difference]: Start difference. First operand 639 states and 893 transitions. Second operand has 8 states, 8 states have (on average 60.25) internal successors, (482), 7 states have internal predecessors, (482), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:34:38,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:38,007 INFO L93 Difference]: Finished difference Result 1405 states and 1981 transitions. [2024-10-11 16:34:38,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:34:38,008 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 60.25) internal successors, (482), 7 states have internal predecessors, (482), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 181 [2024-10-11 16:34:38,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:38,012 INFO L225 Difference]: With dead ends: 1405 [2024-10-11 16:34:38,012 INFO L226 Difference]: Without dead ends: 1376 [2024-10-11 16:34:38,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:34:38,013 INFO L432 NwaCegarLoop]: 591 mSDtfsCounter, 2033 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2065 SdHoareTripleChecker+Valid, 2506 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:38,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2065 Valid, 2506 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:34:38,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2024-10-11 16:34:38,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1374. [2024-10-11 16:34:38,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1337 states have (on average 1.3732236350037397) internal successors, (1836), 1347 states have internal predecessors, (1836), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 25 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 16:34:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1904 transitions. [2024-10-11 16:34:38,037 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1904 transitions. Word has length 181 [2024-10-11 16:34:38,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:38,038 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 1904 transitions. [2024-10-11 16:34:38,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 60.25) internal successors, (482), 7 states have internal predecessors, (482), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:34:38,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1904 transitions. [2024-10-11 16:34:38,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2024-10-11 16:34:38,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:38,045 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2024-10-11 16:34:38,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 16:34:38,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:34:38,246 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:38,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:38,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1847827212, now seen corresponding path program 1 times [2024-10-11 16:34:38,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:38,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597843046] [2024-10-11 16:34:38,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:38,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:34:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:39,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 16:34:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:39,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 16:34:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:39,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 16:34:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:39,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 16:34:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:39,642 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:34:39,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:34:39,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597843046] [2024-10-11 16:34:39,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597843046] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:34:39,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996812713] [2024-10-11 16:34:39,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:39,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:34:39,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:34:39,646 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:34:39,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 16:34:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:34:40,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 3112 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 16:34:40,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:34:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:34:41,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:34:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:34:41,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996812713] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:34:41,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:34:41,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2024-10-11 16:34:41,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458789129] [2024-10-11 16:34:41,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:34:41,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 16:34:41,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:34:41,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 16:34:41,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2024-10-11 16:34:41,769 INFO L87 Difference]: Start difference. First operand 1374 states and 1904 transitions. Second operand has 14 states, 14 states have (on average 97.0) internal successors, (1358), 13 states have internal predecessors, (1358), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:34:42,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:34:42,560 INFO L93 Difference]: Finished difference Result 3421 states and 4804 transitions. [2024-10-11 16:34:42,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 16:34:42,561 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 97.0) internal successors, (1358), 13 states have internal predecessors, (1358), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 619 [2024-10-11 16:34:42,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:34:42,570 INFO L225 Difference]: With dead ends: 3421 [2024-10-11 16:34:42,570 INFO L226 Difference]: Without dead ends: 3392 [2024-10-11 16:34:42,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1250 GetRequests, 1238 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2024-10-11 16:34:42,571 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 6017 mSDsluCounter, 4923 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6121 SdHoareTripleChecker+Valid, 5471 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:34:42,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6121 Valid, 5471 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:34:42,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3392 states. [2024-10-11 16:34:42,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3392 to 3390. [2024-10-11 16:34:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3390 states, 3317 states have (on average 1.371118480554718) internal successors, (4548), 3327 states have internal predecessors, (4548), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 61 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 16:34:42,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 4688 transitions. [2024-10-11 16:34:42,619 INFO L78 Accepts]: Start accepts. Automaton has 3390 states and 4688 transitions. Word has length 619 [2024-10-11 16:34:42,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:34:42,619 INFO L471 AbstractCegarLoop]: Abstraction has 3390 states and 4688 transitions. [2024-10-11 16:34:42,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 97.0) internal successors, (1358), 13 states have internal predecessors, (1358), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:34:42,620 INFO L276 IsEmpty]: Start isEmpty. Operand 3390 states and 4688 transitions. [2024-10-11 16:34:42,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2024-10-11 16:34:42,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:34:42,663 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 16:34:42,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 16:34:42,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:34:42,864 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:34:42,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:34:42,865 INFO L85 PathProgramCache]: Analyzing trace with hash 756665314, now seen corresponding path program 2 times [2024-10-11 16:34:42,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:34:42,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980051119] [2024-10-11 16:34:42,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:34:42,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms