./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_SAX_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a379a11019678fc2a367efcf212f49fd3083d5f94e928c550866b32de723f686 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:19:51,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:19:51,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 09:19:51,952 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:19:51,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:19:51,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:19:51,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:19:51,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:19:51,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 09:19:51,989 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 09:19:51,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:19:51,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:19:51,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:19:51,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:19:51,991 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:19:51,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:19:51,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:19:51,993 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:19:51,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:19:51,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:19:51,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:19:51,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:19:51,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:19:51,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:19:51,998 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:19:51,998 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:19:51,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:19:51,999 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:19:51,999 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:19:51,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:19:51,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 09:19:52,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:19:52,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:19:52,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:19:52,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:19:52,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:19:52,001 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:19:52,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:19:52,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:19:52,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:19:52,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:19:52,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:19:52,003 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a379a11019678fc2a367efcf212f49fd3083d5f94e928c550866b32de723f686 [2024-10-13 09:19:52,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:19:52,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:19:52,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:19:52,289 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:19:52,290 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:19:52,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test3-1.i [2024-10-13 09:19:53,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:19:54,028 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:19:54,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test3-1.i [2024-10-13 09:19:54,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66717369b/904a9367cc93495e9663b8b50f884289/FLAG9af433efe [2024-10-13 09:19:54,072 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66717369b/904a9367cc93495e9663b8b50f884289 [2024-10-13 09:19:54,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:19:54,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:19:54,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:19:54,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:19:54,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:19:54,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:19:54" (1/1) ... [2024-10-13 09:19:54,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@377ba5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:19:54, skipping insertion in model container [2024-10-13 09:19:54,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:19:54" (1/1) ... [2024-10-13 09:19:54,156 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:19:54,531 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_SAX_test3-1.i[33021,33034] [2024-10-13 09:19:54,674 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_SAX_test3-1.i[44590,44603] [2024-10-13 09:19:54,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:19:54,700 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:19:54,742 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_SAX_test3-1.i[33021,33034] [2024-10-13 09:19:54,795 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_SAX_test3-1.i[44590,44603] [2024-10-13 09:19:54,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:19:54,832 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:19:54,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:19:54 WrapperNode [2024-10-13 09:19:54,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:19:54,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:19:54,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:19:54,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:19:54,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:19:54" (1/1) ... [2024-10-13 09:19:54,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:19:54" (1/1) ... [2024-10-13 09:19:54,941 INFO L138 Inliner]: procedures = 177, calls = 277, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1455 [2024-10-13 09:19:54,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:19:54,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:19:54,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:19:54,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:19:54,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:19:54" (1/1) ... [2024-10-13 09:19:54,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:19:54" (1/1) ... [2024-10-13 09:19:54,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:19:54" (1/1) ... [2024-10-13 09:19:55,046 INFO L175 MemorySlicer]: Split 255 memory accesses to 3 slices as follows [2, 34, 219]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-10-13 09:19:55,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:19:54" (1/1) ... [2024-10-13 09:19:55,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:19:54" (1/1) ... [2024-10-13 09:19:55,090 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:19:54" (1/1) ... [2024-10-13 09:19:55,103 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:19:54" (1/1) ... [2024-10-13 09:19:55,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:19:54" (1/1) ... [2024-10-13 09:19:55,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:19:54" (1/1) ... [2024-10-13 09:19:55,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:19:55,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:19:55,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:19:55,123 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:19:55,124 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:19:54" (1/1) ... [2024-10-13 09:19:55,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:19:55,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:19:55,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 09:19:55,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 09:19:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 09:19:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 09:19:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 09:19:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 09:19:55,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 09:19:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 09:19:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 09:19:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 09:19:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 09:19:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 09:19:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 09:19:55,208 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 09:19:55,208 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 09:19:55,208 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 09:19:55,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 09:19:55,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:19:55,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 09:19:55,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 09:19:55,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 09:19:55,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 09:19:55,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 09:19:55,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 09:19:55,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 09:19:55,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 09:19:55,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 09:19:55,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 09:19:55,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 09:19:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:19:55,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:19:55,467 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:19:55,469 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:19:56,903 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2024-10-13 09:19:56,903 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:19:56,950 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:19:56,950 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-13 09:19:56,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:19:56 BoogieIcfgContainer [2024-10-13 09:19:56,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:19:56,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:19:56,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:19:56,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:19:56,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:19:54" (1/3) ... [2024-10-13 09:19:56,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@685d6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:19:56, skipping insertion in model container [2024-10-13 09:19:56,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:19:54" (2/3) ... [2024-10-13 09:19:56,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@685d6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:19:56, skipping insertion in model container [2024-10-13 09:19:56,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:19:56" (3/3) ... [2024-10-13 09:19:56,960 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test3-1.i [2024-10-13 09:19:56,975 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:19:56,975 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 09:19:57,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:19:57,058 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;@3a9bfa3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:19:57,058 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 09:19:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 406 states, 393 states have (on average 1.633587786259542) internal successors, (642), 400 states have internal predecessors, (642), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 09:19:57,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 09:19:57,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:19:57,069 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:19:57,070 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:19:57,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:19:57,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1914372056, now seen corresponding path program 1 times [2024-10-13 09:19:57,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:19:57,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371635227] [2024-10-13 09:19:57,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:19:57,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:19:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:19:57,246 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-13 09:19:57,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:19:57,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371635227] [2024-10-13 09:19:57,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371635227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:19:57,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:19:57,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:19:57,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944697499] [2024-10-13 09:19:57,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:19:57,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 09:19:57,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:19:57,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 09:19:57,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 09:19:57,286 INFO L87 Difference]: Start difference. First operand has 406 states, 393 states have (on average 1.633587786259542) internal successors, (642), 400 states have internal predecessors, (642), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:19:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:19:57,382 INFO L93 Difference]: Finished difference Result 811 states and 1320 transitions. [2024-10-13 09:19:57,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 09:19:57,386 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-13 09:19:57,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:19:57,401 INFO L225 Difference]: With dead ends: 811 [2024-10-13 09:19:57,401 INFO L226 Difference]: Without dead ends: 404 [2024-10-13 09:19:57,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 09:19:57,409 INFO L432 NwaCegarLoop]: 585 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:19:57,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 585 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 09:19:57,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-10-13 09:19:57,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-10-13 09:19:57,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 392 states have (on average 1.4566326530612246) internal successors, (571), 398 states have internal predecessors, (571), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 09:19:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 587 transitions. [2024-10-13 09:19:57,486 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 587 transitions. Word has length 8 [2024-10-13 09:19:57,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:19:57,487 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 587 transitions. [2024-10-13 09:19:57,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:19:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 587 transitions. [2024-10-13 09:19:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 09:19:57,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:19:57,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:19:57,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:19:57,489 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:19:57,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:19:57,490 INFO L85 PathProgramCache]: Analyzing trace with hash 430792996, now seen corresponding path program 1 times [2024-10-13 09:19:57,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:19:57,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724179971] [2024-10-13 09:19:57,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:19:57,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:19:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:19:57,711 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-13 09:19:57,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:19:57,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724179971] [2024-10-13 09:19:57,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724179971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:19:57,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:19:57,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:19:57,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560156436] [2024-10-13 09:19:57,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:19:57,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:19:57,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:19:57,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:19:57,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:19:57,720 INFO L87 Difference]: Start difference. First operand 404 states and 587 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-13 09:19:57,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:19:57,909 INFO L93 Difference]: Finished difference Result 1002 states and 1464 transitions. [2024-10-13 09:19:57,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:19:57,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2024-10-13 09:19:57,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:19:57,918 INFO L225 Difference]: With dead ends: 1002 [2024-10-13 09:19:57,918 INFO L226 Difference]: Without dead ends: 797 [2024-10-13 09:19:57,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-13 09:19:57,923 INFO L432 NwaCegarLoop]: 610 mSDtfsCounter, 558 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:19:57,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1776 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:19:57,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-10-13 09:19:57,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 406. [2024-10-13 09:19:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 394 states have (on average 1.4543147208121827) internal successors, (573), 400 states have internal predecessors, (573), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 09:19:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 589 transitions. [2024-10-13 09:19:57,964 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 589 transitions. Word has length 13 [2024-10-13 09:19:57,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:19:57,964 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 589 transitions. [2024-10-13 09:19:57,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-13 09:19:57,967 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 589 transitions. [2024-10-13 09:19:57,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 09:19:57,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:19:57,971 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 09:19:57,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:19:57,972 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:19:57,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:19:57,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1311525701, now seen corresponding path program 1 times [2024-10-13 09:19:57,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:19:57,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169028011] [2024-10-13 09:19:57,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:19:57,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:19:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:19:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:19:58,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:19:58,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169028011] [2024-10-13 09:19:58,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169028011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:19:58,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:19:58,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 09:19:58,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076522584] [2024-10-13 09:19:58,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:19:58,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:19:58,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:19:58,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:19:58,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:19:58,378 INFO L87 Difference]: Start difference. First operand 406 states and 589 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-13 09:19:58,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:19:58,478 INFO L93 Difference]: Finished difference Result 812 states and 1178 transitions. [2024-10-13 09:19:58,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:19:58,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 89 [2024-10-13 09:19:58,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:19:58,482 INFO L225 Difference]: With dead ends: 812 [2024-10-13 09:19:58,483 INFO L226 Difference]: Without dead ends: 409 [2024-10-13 09:19:58,485 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-13 09:19:58,486 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 105 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1577 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-13 09:19:58,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1577 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:19:58,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-13 09:19:58,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2024-10-13 09:19:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 394 states have (on average 1.4365482233502538) internal successors, (566), 400 states have internal predecessors, (566), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 09:19:58,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 582 transitions. [2024-10-13 09:19:58,504 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 582 transitions. Word has length 89 [2024-10-13 09:19:58,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:19:58,505 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 582 transitions. [2024-10-13 09:19:58,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-13 09:19:58,505 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 582 transitions. [2024-10-13 09:19:58,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 09:19:58,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:19:58,509 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 09:19:58,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:19:58,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:19:58,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:19:58,510 INFO L85 PathProgramCache]: Analyzing trace with hash -58083887, now seen corresponding path program 1 times [2024-10-13 09:19:58,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:19:58,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043231737] [2024-10-13 09:19:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:19:58,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:19:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:19:58,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:19:58,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:19:58,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043231737] [2024-10-13 09:19:58,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043231737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:19:58,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:19:58,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:19:58,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360837130] [2024-10-13 09:19:58,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:19:58,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:19:58,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:19:58,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:19:58,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:19:58,746 INFO L87 Difference]: Start difference. First operand 406 states and 582 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 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-13 09:19:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:19:58,854 INFO L93 Difference]: Finished difference Result 1102 states and 1592 transitions. [2024-10-13 09:19:58,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:19:58,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 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 89 [2024-10-13 09:19:58,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:19:58,859 INFO L225 Difference]: With dead ends: 1102 [2024-10-13 09:19:58,860 INFO L226 Difference]: Without dead ends: 699 [2024-10-13 09:19:58,862 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-13 09:19:58,864 INFO L432 NwaCegarLoop]: 763 mSDtfsCounter, 371 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:19:58,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1317 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:19:58,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-10-13 09:19:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 695. [2024-10-13 09:19:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 683 states have (on average 1.452415812591508) internal successors, (992), 689 states have internal predecessors, (992), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 09:19:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1008 transitions. [2024-10-13 09:19:58,916 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1008 transitions. Word has length 89 [2024-10-13 09:19:58,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:19:58,918 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 1008 transitions. [2024-10-13 09:19:58,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 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-13 09:19:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1008 transitions. [2024-10-13 09:19:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-13 09:19:58,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:19:58,926 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:19:58,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:19:58,927 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:19:58,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:19:58,927 INFO L85 PathProgramCache]: Analyzing trace with hash -861455229, now seen corresponding path program 1 times [2024-10-13 09:19:58,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:19:58,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461142673] [2024-10-13 09:19:58,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:19:58,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:19:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:19:59,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:19:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:19:59,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:19:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:19:59,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 09:19:59,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:19:59,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461142673] [2024-10-13 09:19:59,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461142673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:19:59,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:19:59,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:19:59,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924546265] [2024-10-13 09:19:59,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:19:59,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 09:19:59,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:19:59,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 09:19:59,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:19:59,367 INFO L87 Difference]: Start difference. First operand 695 states and 1008 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 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-13 09:19:59,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:19:59,761 INFO L93 Difference]: Finished difference Result 994 states and 1439 transitions. [2024-10-13 09:19:59,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 09:19:59,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 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 102 [2024-10-13 09:19:59,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:19:59,768 INFO L225 Difference]: With dead ends: 994 [2024-10-13 09:19:59,768 INFO L226 Difference]: Without dead ends: 975 [2024-10-13 09:19:59,770 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-13 09:19:59,771 INFO L432 NwaCegarLoop]: 552 mSDtfsCounter, 541 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:19:59,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 2112 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 09:19:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-10-13 09:19:59,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 697. [2024-10-13 09:19:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 685 states have (on average 1.4510948905109489) internal successors, (994), 691 states have internal predecessors, (994), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 09:19:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1010 transitions. [2024-10-13 09:19:59,802 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1010 transitions. Word has length 102 [2024-10-13 09:19:59,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:19:59,804 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 1010 transitions. [2024-10-13 09:19:59,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 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-13 09:19:59,805 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1010 transitions. [2024-10-13 09:19:59,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 09:19:59,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:19:59,808 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 09:19:59,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:19:59,809 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:19:59,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:19:59,809 INFO L85 PathProgramCache]: Analyzing trace with hash 860472497, now seen corresponding path program 1 times [2024-10-13 09:19:59,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:19:59,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276290757] [2024-10-13 09:19:59,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:19:59,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:19:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:20:00,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:20:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:20:00,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:20:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:20:00,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 09:20:00,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:20:00,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276290757] [2024-10-13 09:20:00,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276290757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:20:00,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:20:00,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:20:00,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109651865] [2024-10-13 09:20:00,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:20:00,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 09:20:00,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:20:00,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 09:20:00,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:20:00,113 INFO L87 Difference]: Start difference. First operand 697 states and 1010 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:20:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:20:00,429 INFO L93 Difference]: Finished difference Result 1069 states and 1558 transitions. [2024-10-13 09:20:00,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 09:20:00,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2024-10-13 09:20:00,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:20:00,434 INFO L225 Difference]: With dead ends: 1069 [2024-10-13 09:20:00,434 INFO L226 Difference]: Without dead ends: 705 [2024-10-13 09:20:00,435 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-13 09:20:00,438 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 112 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1988 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:20:00,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1988 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 09:20:00,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-13 09:20:00,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 697. [2024-10-13 09:20:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 685 states have (on average 1.4306569343065694) internal successors, (980), 691 states have internal predecessors, (980), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 09:20:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 996 transitions. [2024-10-13 09:20:00,464 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 996 transitions. Word has length 152 [2024-10-13 09:20:00,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:20:00,464 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 996 transitions. [2024-10-13 09:20:00,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:20:00,465 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 996 transitions. [2024-10-13 09:20:00,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 09:20:00,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:20:00,468 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 09:20:00,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:20:00,470 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:20:00,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:20:00,471 INFO L85 PathProgramCache]: Analyzing trace with hash -311041627, now seen corresponding path program 1 times [2024-10-13 09:20:00,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:20:00,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736580110] [2024-10-13 09:20:00,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:20:00,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:20:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:20:00,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:20:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:20:00,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:20:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:20:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:20:00,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:20:00,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736580110] [2024-10-13 09:20:00,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736580110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:20:00,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:20:00,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:20:00,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541270221] [2024-10-13 09:20:00,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:20:00,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:20:00,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:20:00,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:20:00,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:20:00,822 INFO L87 Difference]: Start difference. First operand 697 states and 996 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:20:01,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:20:01,714 INFO L93 Difference]: Finished difference Result 1704 states and 2434 transitions. [2024-10-13 09:20:01,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:20:01,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2024-10-13 09:20:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:20:01,722 INFO L225 Difference]: With dead ends: 1704 [2024-10-13 09:20:01,722 INFO L226 Difference]: Without dead ends: 1139 [2024-10-13 09:20:01,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:20:01,724 INFO L432 NwaCegarLoop]: 727 mSDtfsCounter, 1883 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1890 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 09:20:01,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1890 Valid, 2381 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 09:20:01,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-10-13 09:20:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 878. [2024-10-13 09:20:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 866 states have (on average 1.430715935334873) internal successors, (1239), 872 states have internal predecessors, (1239), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 09:20:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1255 transitions. [2024-10-13 09:20:01,758 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1255 transitions. Word has length 152 [2024-10-13 09:20:01,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:20:01,759 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1255 transitions. [2024-10-13 09:20:01,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:20:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1255 transitions. [2024-10-13 09:20:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 09:20:01,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:20:01,761 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 09:20:01,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:20:01,762 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:20:01,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:20:01,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1276656359, now seen corresponding path program 1 times [2024-10-13 09:20:01,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:20:01,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905177241] [2024-10-13 09:20:01,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:20:01,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:20:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:20:02,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:20:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:20:02,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:20:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:20:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:20:02,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:20:02,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905177241] [2024-10-13 09:20:02,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905177241] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:20:02,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025243309] [2024-10-13 09:20:02,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:20:02,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:20:02,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:20:02,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:20:02,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 09:20:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:20:03,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 09:20:03,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:20:03,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 09:20:03,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-13 09:20:03,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 09:20:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:20:03,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:20:03,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:20:03,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025243309] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:20:03,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:20:03,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2024-10-13 09:20:03,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055244762] [2024-10-13 09:20:03,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:20:03,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 09:20:03,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:20:03,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 09:20:03,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-13 09:20:03,509 INFO L87 Difference]: Start difference. First operand 878 states and 1255 transitions. Second operand has 12 states, 12 states have (on average 27.0) internal successors, (324), 11 states have internal predecessors, (324), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 09:20:04,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:20:04,201 INFO L93 Difference]: Finished difference Result 2791 states and 3987 transitions. [2024-10-13 09:20:04,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 09:20:04,202 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 27.0) internal successors, (324), 11 states have internal predecessors, (324), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 162 [2024-10-13 09:20:04,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:20:04,212 INFO L225 Difference]: With dead ends: 2791 [2024-10-13 09:20:04,212 INFO L226 Difference]: Without dead ends: 2243 [2024-10-13 09:20:04,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-10-13 09:20:04,214 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 2498 mSDsluCounter, 3219 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2511 SdHoareTripleChecker+Valid, 3814 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:20:04,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2511 Valid, 3814 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 09:20:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2024-10-13 09:20:04,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 1308. [2024-10-13 09:20:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 1292 states have (on average 1.4202786377708978) internal successors, (1835), 1298 states have internal predecessors, (1835), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 09:20:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1857 transitions. [2024-10-13 09:20:04,282 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1857 transitions. Word has length 162 [2024-10-13 09:20:04,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:20:04,283 INFO L471 AbstractCegarLoop]: Abstraction has 1308 states and 1857 transitions. [2024-10-13 09:20:04,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.0) internal successors, (324), 11 states have internal predecessors, (324), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 09:20:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1857 transitions. [2024-10-13 09:20:04,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-10-13 09:20:04,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:20:04,289 INFO L215 NwaCegarLoop]: trace histogram [5, 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, 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] [2024-10-13 09:20:04,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 09:20:04,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:20:04,491 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:20:04,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:20:04,491 INFO L85 PathProgramCache]: Analyzing trace with hash 372273312, now seen corresponding path program 1 times [2024-10-13 09:20:04,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:20:04,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418901938] [2024-10-13 09:20:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:20:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:20:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:20:08,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:20:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:20:08,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:20:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:20:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:20:08,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:20:08,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418901938] [2024-10-13 09:20:08,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418901938] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:20:08,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782613876] [2024-10-13 09:20:08,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:20:08,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:20:08,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:20:08,222 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:20:08,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 09:20:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:20:08,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 09:20:08,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:20:08,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 09:20:09,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-13 09:20:09,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-13 09:20:09,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-13 09:20:09,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-13 09:20:09,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 09:20:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:20:09,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:20:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:20:10,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782613876] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:20:10,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:20:10,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 21 [2024-10-13 09:20:10,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204929980] [2024-10-13 09:20:10,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:20:10,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 09:20:10,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:20:10,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 09:20:10,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2024-10-13 09:20:10,157 INFO L87 Difference]: Start difference. First operand 1308 states and 1857 transitions. Second operand has 21 states, 21 states have (on average 37.42857142857143) internal successors, (786), 20 states have internal predecessors, (786), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 09:20:11,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:20:11,326 INFO L93 Difference]: Finished difference Result 5524 states and 7908 transitions. [2024-10-13 09:20:11,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 09:20:11,328 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 37.42857142857143) internal successors, (786), 20 states have internal predecessors, (786), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 390 [2024-10-13 09:20:11,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:20:11,350 INFO L225 Difference]: With dead ends: 5524 [2024-10-13 09:20:11,350 INFO L226 Difference]: Without dead ends: 4976 [2024-10-13 09:20:11,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 803 GetRequests, 774 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2024-10-13 09:20:11,356 INFO L432 NwaCegarLoop]: 599 mSDtfsCounter, 7763 mSDsluCounter, 7915 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7803 SdHoareTripleChecker+Valid, 8514 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 09:20:11,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7803 Valid, 8514 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 09:20:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4976 states. [2024-10-13 09:20:11,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4976 to 2424. [2024-10-13 09:20:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2424 states, 2402 states have (on average 1.4159034138218152) internal successors, (3401), 2408 states have internal predecessors, (3401), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 09:20:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 3435 transitions. [2024-10-13 09:20:11,517 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 3435 transitions. Word has length 390 [2024-10-13 09:20:11,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:20:11,518 INFO L471 AbstractCegarLoop]: Abstraction has 2424 states and 3435 transitions. [2024-10-13 09:20:11,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 37.42857142857143) internal successors, (786), 20 states have internal predecessors, (786), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 09:20:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 3435 transitions. [2024-10-13 09:20:11,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2024-10-13 09:20:11,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:20:11,542 INFO L215 NwaCegarLoop]: trace histogram [11, 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, 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] [2024-10-13 09:20:11,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 09:20:11,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-13 09:20:11,744 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:20:11,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:20:11,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1358747346, now seen corresponding path program 2 times [2024-10-13 09:20:11,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:20:11,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740736519] [2024-10-13 09:20:11,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:20:11,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms