./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/list_search-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list_search-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu --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 b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:05:05,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:05:05,085 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 08:05:05,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:05:05,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:05:05,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:05:05,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:05:05,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:05:05,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:05:05,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:05:05,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:05:05,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:05:05,125 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:05:05,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:05:05,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:05:05,127 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:05:05,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:05:05,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:05:05,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:05:05,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:05:05,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:05:05,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:05:05,132 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:05:05,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:05:05,133 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:05:05,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:05:05,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:05:05,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:05:05,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:05:05,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:05:05,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:05:05,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:05:05,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:05:05,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:05:05,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:05:05,139 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:05:05,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:05:05,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:05:05,140 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:05:05,141 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu 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 -> b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 [2023-11-19 08:05:05,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:05:05,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:05:05,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:05:05,475 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:05:05,475 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:05:05,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/list-properties/list_search-2.i [2023-11-19 08:05:08,871 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:05:09,186 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:05:09,187 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/sv-benchmarks/c/list-properties/list_search-2.i [2023-11-19 08:05:09,212 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/data/6a9df429f/194aace0a36f4b21b7ae1a740bd52e16/FLAG7073638c2 [2023-11-19 08:05:09,227 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/data/6a9df429f/194aace0a36f4b21b7ae1a740bd52e16 [2023-11-19 08:05:09,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:05:09,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:05:09,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:05:09,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:05:09,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:05:09,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:05:09" (1/1) ... [2023-11-19 08:05:09,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157fd9da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:09, skipping insertion in model container [2023-11-19 08:05:09,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:05:09" (1/1) ... [2023-11-19 08:05:09,306 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:05:09,512 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/sv-benchmarks/c/list-properties/list_search-2.i[813,826] [2023-11-19 08:05:09,774 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:05:09,788 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:05:09,803 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/sv-benchmarks/c/list-properties/list_search-2.i[813,826] [2023-11-19 08:05:09,870 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:05:09,940 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:05:09,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:09 WrapperNode [2023-11-19 08:05:09,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:05:09,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:05:09,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:05:09,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:05:09,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:09" (1/1) ... [2023-11-19 08:05:09,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:09" (1/1) ... [2023-11-19 08:05:10,037 INFO L138 Inliner]: procedures = 226, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 100 [2023-11-19 08:05:10,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:05:10,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:05:10,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:05:10,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:05:10,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:09" (1/1) ... [2023-11-19 08:05:10,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:09" (1/1) ... [2023-11-19 08:05:10,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:09" (1/1) ... [2023-11-19 08:05:10,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:09" (1/1) ... [2023-11-19 08:05:10,079 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:09" (1/1) ... [2023-11-19 08:05:10,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:09" (1/1) ... [2023-11-19 08:05:10,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:09" (1/1) ... [2023-11-19 08:05:10,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:09" (1/1) ... [2023-11-19 08:05:10,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:05:10,119 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:05:10,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:05:10,120 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:05:10,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:09" (1/1) ... [2023-11-19 08:05:10,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:05:10,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:05:10,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:05:10,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:05:10,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 08:05:10,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:05:10,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 08:05:10,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:05:10,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 08:05:10,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:05:10,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 08:05:10,210 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2023-11-19 08:05:10,210 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2023-11-19 08:05:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:05:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:05:10,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:05:10,344 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:05:10,347 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:05:10,672 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:05:10,680 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:05:10,681 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-19 08:05:10,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:05:10 BoogieIcfgContainer [2023-11-19 08:05:10,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:05:10,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:05:10,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:05:10,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:05:10,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:05:09" (1/3) ... [2023-11-19 08:05:10,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf029c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:05:10, skipping insertion in model container [2023-11-19 08:05:10,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:09" (2/3) ... [2023-11-19 08:05:10,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf029c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:05:10, skipping insertion in model container [2023-11-19 08:05:10,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:05:10" (3/3) ... [2023-11-19 08:05:10,698 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search-2.i [2023-11-19 08:05:10,719 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:05:10,719 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 08:05:10,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:05:10,789 INFO L357 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, mHoare=true, 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;@7de75173, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:05:10,790 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 08:05:10,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 08:05:10,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-19 08:05:10,804 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:05:10,805 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:10,805 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:05:10,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:10,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1135484681, now seen corresponding path program 1 times [2023-11-19 08:05:10,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:10,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628383234] [2023-11-19 08:05:10,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:10,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:11,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:11,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-19 08:05:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:11,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:05:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:11,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 08:05:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:11,771 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 08:05:11,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:11,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628383234] [2023-11-19 08:05:11,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628383234] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:05:11,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297555447] [2023-11-19 08:05:11,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:11,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:05:11,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:05:11,779 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:05:11,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 08:05:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:11,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-19 08:05:11,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:05:12,001 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-19 08:05:12,001 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 08:05:12,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297555447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:12,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 08:05:12,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2023-11-19 08:05:12,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079614757] [2023-11-19 08:05:12,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:12,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:05:12,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:12,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:05:12,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:05:12,049 INFO L87 Difference]: Start difference. First operand has 36 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-19 08:05:12,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:05:12,077 INFO L93 Difference]: Finished difference Result 56 states and 78 transitions. [2023-11-19 08:05:12,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:05:12,080 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2023-11-19 08:05:12,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:05:12,088 INFO L225 Difference]: With dead ends: 56 [2023-11-19 08:05:12,088 INFO L226 Difference]: Without dead ends: 25 [2023-11-19 08:05:12,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:05:12,095 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 08:05:12,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 08:05:12,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-19 08:05:12,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-19 08:05:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 08:05:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2023-11-19 08:05:12,148 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 37 [2023-11-19 08:05:12,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:05:12,150 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2023-11-19 08:05:12,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-19 08:05:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2023-11-19 08:05:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-19 08:05:12,156 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:05:12,156 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:12,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 08:05:12,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-19 08:05:12,372 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:05:12,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:12,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1275349378, now seen corresponding path program 1 times [2023-11-19 08:05:12,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:12,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680699654] [2023-11-19 08:05:12,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:12,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:12,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:12,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-19 08:05:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:12,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:05:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:12,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 08:05:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 08:05:12,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:12,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680699654] [2023-11-19 08:05:12,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680699654] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:05:12,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228098141] [2023-11-19 08:05:12,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:12,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:05:12,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:05:12,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:05:12,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 08:05:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:12,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-19 08:05:12,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:05:13,035 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-19 08:05:13,035 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 08:05:13,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228098141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:13,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 08:05:13,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2023-11-19 08:05:13,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744065096] [2023-11-19 08:05:13,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:13,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:05:13,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:13,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:05:13,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:05:13,043 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-19 08:05:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:05:13,134 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2023-11-19 08:05:13,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:05:13,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2023-11-19 08:05:13,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:05:13,136 INFO L225 Difference]: With dead ends: 49 [2023-11-19 08:05:13,136 INFO L226 Difference]: Without dead ends: 29 [2023-11-19 08:05:13,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-19 08:05:13,140 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 08:05:13,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 66 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 08:05:13,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-19 08:05:13,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-11-19 08:05:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 08:05:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-11-19 08:05:13,166 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 39 [2023-11-19 08:05:13,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:05:13,167 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-11-19 08:05:13,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-19 08:05:13,168 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-11-19 08:05:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-19 08:05:13,175 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:05:13,176 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:13,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-19 08:05:13,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:05:13,397 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:05:13,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:13,398 INFO L85 PathProgramCache]: Analyzing trace with hash 104078038, now seen corresponding path program 1 times [2023-11-19 08:05:13,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:13,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912785170] [2023-11-19 08:05:13,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:13,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:13,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:13,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-19 08:05:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:13,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:05:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:13,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 08:05:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-19 08:05:13,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:13,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912785170] [2023-11-19 08:05:13,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912785170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:13,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:13,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 08:05:13,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139835640] [2023-11-19 08:05:13,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:13,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 08:05:13,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:13,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 08:05:13,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:05:13,869 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-19 08:05:14,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:05:14,003 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2023-11-19 08:05:14,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 08:05:14,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2023-11-19 08:05:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:05:14,007 INFO L225 Difference]: With dead ends: 34 [2023-11-19 08:05:14,007 INFO L226 Difference]: Without dead ends: 29 [2023-11-19 08:05:14,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-19 08:05:14,012 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 08:05:14,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 146 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 08:05:14,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-19 08:05:14,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-19 08:05:14,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 08:05:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-11-19 08:05:14,025 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 40 [2023-11-19 08:05:14,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:05:14,026 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-19 08:05:14,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-19 08:05:14,026 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-11-19 08:05:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-19 08:05:14,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:05:14,030 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:14,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:05:14,031 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:05:14,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:14,031 INFO L85 PathProgramCache]: Analyzing trace with hash 161336340, now seen corresponding path program 1 times [2023-11-19 08:05:14,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:14,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210355903] [2023-11-19 08:05:14,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:14,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:14,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:14,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-19 08:05:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:14,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:05:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 08:05:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-19 08:05:14,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:14,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210355903] [2023-11-19 08:05:14,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210355903] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:05:14,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817085096] [2023-11-19 08:05:14,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:14,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:05:14,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:05:14,330 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:05:14,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 08:05:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:14,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-19 08:05:14,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:05:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-19 08:05:14,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:05:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-19 08:05:14,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817085096] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-19 08:05:14,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-19 08:05:14,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 17 [2023-11-19 08:05:14,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681395570] [2023-11-19 08:05:14,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:14,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 08:05:14,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:14,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 08:05:14,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-11-19 08:05:14,895 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-19 08:05:15,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:05:15,098 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-11-19 08:05:15,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 08:05:15,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2023-11-19 08:05:15,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:05:15,101 INFO L225 Difference]: With dead ends: 42 [2023-11-19 08:05:15,101 INFO L226 Difference]: Without dead ends: 33 [2023-11-19 08:05:15,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2023-11-19 08:05:15,105 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 44 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 08:05:15,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 96 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 08:05:15,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-19 08:05:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-11-19 08:05:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 08:05:15,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-11-19 08:05:15,124 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 40 [2023-11-19 08:05:15,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:05:15,126 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-19 08:05:15,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-19 08:05:15,127 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-11-19 08:05:15,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-19 08:05:15,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:05:15,132 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2023-11-19 08:05:15,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 08:05:15,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:05:15,333 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:05:15,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:15,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1968420967, now seen corresponding path program 1 times [2023-11-19 08:05:15,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:15,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608989319] [2023-11-19 08:05:15,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:15,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:15,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:15,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-19 08:05:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:15,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:05:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:15,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 08:05:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:16,054 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-19 08:05:16,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:16,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608989319] [2023-11-19 08:05:16,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608989319] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:05:16,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611097994] [2023-11-19 08:05:16,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:16,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:05:16,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:05:16,060 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:05:16,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 08:05:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:16,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-19 08:05:16,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:05:16,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-19 08:05:16,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2023-11-19 08:05:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-19 08:05:16,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:05:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-19 08:05:16,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611097994] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:05:16,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:05:16,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2023-11-19 08:05:16,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121689358] [2023-11-19 08:05:16,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:05:16,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-19 08:05:16,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:16,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-19 08:05:16,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2023-11-19 08:05:16,678 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 3 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-19 08:05:17,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:05:17,429 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2023-11-19 08:05:17,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-19 08:05:17,431 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 3 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2023-11-19 08:05:17,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:05:17,433 INFO L225 Difference]: With dead ends: 56 [2023-11-19 08:05:17,433 INFO L226 Difference]: Without dead ends: 44 [2023-11-19 08:05:17,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=303, Invalid=1419, Unknown=0, NotChecked=0, Total=1722 [2023-11-19 08:05:17,435 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 140 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 08:05:17,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 222 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 08:05:17,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-19 08:05:17,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2023-11-19 08:05:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-19 08:05:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2023-11-19 08:05:17,448 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 43 [2023-11-19 08:05:17,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:05:17,449 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2023-11-19 08:05:17,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 3 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-19 08:05:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2023-11-19 08:05:17,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-19 08:05:17,454 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:05:17,455 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2023-11-19 08:05:17,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 08:05:17,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:05:17,668 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:05:17,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:17,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1693757662, now seen corresponding path program 2 times [2023-11-19 08:05:17,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:17,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528805004] [2023-11-19 08:05:17,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:17,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:19,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:19,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-19 08:05:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:19,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:05:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:19,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 08:05:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-19 08:05:19,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:19,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528805004] [2023-11-19 08:05:19,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528805004] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:05:19,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150163897] [2023-11-19 08:05:19,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 08:05:19,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:05:19,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:05:19,514 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:05:19,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 08:05:19,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 08:05:19,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:05:19,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-19 08:05:19,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:05:19,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-19 08:05:19,844 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 [2023-11-19 08:05:20,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2023-11-19 08:05:20,022 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 [2023-11-19 08:05:20,137 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-19 08:05:20,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2023-11-19 08:05:20,157 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-19 08:05:20,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-19 08:05:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 08:05:20,377 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:05:20,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:05:20,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2023-11-19 08:05:20,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150163897] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:05:20,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 08:05:20,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 31 [2023-11-19 08:05:20,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710333764] [2023-11-19 08:05:20,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 08:05:20,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-19 08:05:20,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:20,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-19 08:05:20,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1142, Unknown=0, NotChecked=0, Total=1260 [2023-11-19 08:05:20,732 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 27 states have internal predecessors, (61), 4 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-19 08:05:22,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:05:22,560 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2023-11-19 08:05:22,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-19 08:05:22,561 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 27 states have internal predecessors, (61), 4 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 47 [2023-11-19 08:05:22,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:05:22,562 INFO L225 Difference]: With dead ends: 70 [2023-11-19 08:05:22,562 INFO L226 Difference]: Without dead ends: 55 [2023-11-19 08:05:22,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=524, Invalid=3382, Unknown=0, NotChecked=0, Total=3906 [2023-11-19 08:05:22,565 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 160 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 08:05:22,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 257 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 08:05:22,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-19 08:05:22,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2023-11-19 08:05:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-19 08:05:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2023-11-19 08:05:22,589 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 47 [2023-11-19 08:05:22,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:05:22,590 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2023-11-19 08:05:22,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 27 states have internal predecessors, (61), 4 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-19 08:05:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2023-11-19 08:05:22,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-19 08:05:22,597 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:05:22,598 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:22,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-19 08:05:22,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-19 08:05:22,808 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:05:22,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:22,808 INFO L85 PathProgramCache]: Analyzing trace with hash 361857145, now seen corresponding path program 3 times [2023-11-19 08:05:22,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:22,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136634588] [2023-11-19 08:05:22,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:22,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:24,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:24,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-19 08:05:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:24,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:05:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:24,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 08:05:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 08:05:25,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:25,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136634588] [2023-11-19 08:05:25,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136634588] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:05:25,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064133760] [2023-11-19 08:05:25,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 08:05:25,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:05:25,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:05:25,113 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:05:25,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-19 08:05:25,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-19 08:05:25,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:05:25,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 107 conjunts are in the unsatisfiable core [2023-11-19 08:05:25,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:05:25,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-19 08:05:25,455 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 15 treesize of output 1 [2023-11-19 08:05:25,463 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 15 treesize of output 1 [2023-11-19 08:05:25,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2023-11-19 08:05:25,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2023-11-19 08:05:25,908 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-19 08:05:25,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2023-11-19 08:05:25,927 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-19 08:05:25,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2023-11-19 08:05:25,968 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-19 08:05:25,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-11-19 08:05:26,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2023-11-19 08:05:26,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2023-11-19 08:05:26,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:26,246 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-19 08:05:26,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 54 [2023-11-19 08:05:26,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:26,262 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-11-19 08:05:26,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-11-19 08:05:26,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:26,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2023-11-19 08:05:27,258 INFO L349 Elim1Store]: treesize reduction 16, result has 86.8 percent of original size [2023-11-19 08:05:27,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 135 treesize of output 180 [2023-11-19 08:05:27,416 INFO L349 Elim1Store]: treesize reduction 24, result has 80.2 percent of original size [2023-11-19 08:05:27,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 71 treesize of output 143 [2023-11-19 08:05:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 20 proven. 29 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 08:05:29,830 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:05:30,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:05:30,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 78 [2023-11-19 08:05:30,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:05:30,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 69 [2023-11-19 08:05:30,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064133760] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:05:30,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 08:05:30,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 38 [2023-11-19 08:05:30,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419879468] [2023-11-19 08:05:30,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 08:05:30,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-19 08:05:30,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:30,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-19 08:05:30,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1666, Unknown=0, NotChecked=0, Total=1806 [2023-11-19 08:05:30,378 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 6 states have call successors, (8), 3 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-19 08:05:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:05:33,450 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2023-11-19 08:05:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-19 08:05:33,451 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 6 states have call successors, (8), 3 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 51 [2023-11-19 08:05:33,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:05:33,452 INFO L225 Difference]: With dead ends: 72 [2023-11-19 08:05:33,453 INFO L226 Difference]: Without dead ends: 63 [2023-11-19 08:05:33,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=549, Invalid=4007, Unknown=0, NotChecked=0, Total=4556 [2023-11-19 08:05:33,456 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 162 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-19 08:05:33,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 305 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-19 08:05:33,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-19 08:05:33,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2023-11-19 08:05:33,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-19 08:05:33,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2023-11-19 08:05:33,475 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 51 [2023-11-19 08:05:33,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:05:33,475 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2023-11-19 08:05:33,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 6 states have call successors, (8), 3 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-19 08:05:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2023-11-19 08:05:33,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-19 08:05:33,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:05:33,477 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:33,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-19 08:05:33,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-19 08:05:33,691 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:05:33,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:33,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1742339348, now seen corresponding path program 4 times [2023-11-19 08:05:33,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:33,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86052302] [2023-11-19 08:05:33,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:33,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:35,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:35,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-19 08:05:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:35,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:05:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:35,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 08:05:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 34 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-19 08:05:36,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:36,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86052302] [2023-11-19 08:05:36,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86052302] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:05:36,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97698209] [2023-11-19 08:05:36,128 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 08:05:36,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:05:36,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:05:36,130 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:05:36,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-19 08:05:36,349 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 08:05:36,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:05:36,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 142 conjunts are in the unsatisfiable core [2023-11-19 08:05:36,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:05:36,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-19 08:05:36,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-19 08:05:36,657 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 [2023-11-19 08:05:36,664 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 [2023-11-19 08:05:36,810 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-19 08:05:36,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-19 08:05:36,840 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-19 08:05:36,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-11-19 08:05:37,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2023-11-19 08:05:37,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2023-11-19 08:05:37,289 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-19 08:05:37,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-19 08:05:37,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:37,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2023-11-19 08:05:37,326 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-11-19 08:05:37,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2023-11-19 08:05:37,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:37,356 INFO L349 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2023-11-19 08:05:37,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2023-11-19 08:05:37,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2023-11-19 08:05:37,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2023-11-19 08:05:37,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:37,823 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-19 08:05:37,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 70 [2023-11-19 08:05:37,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:37,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:37,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:37,839 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2023-11-19 08:05:37,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-11-19 08:05:37,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2023-11-19 08:05:37,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:37,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:37,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:37,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-11-19 08:05:38,590 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-19 08:05:38,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 55 [2023-11-19 08:05:38,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-19 08:05:38,655 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 21 proven. 38 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-19 08:05:38,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:05:39,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:05:39,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 80 [2023-11-19 08:05:39,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:05:39,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 71 [2023-11-19 08:05:39,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97698209] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:05:39,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 08:05:39,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 45 [2023-11-19 08:05:39,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155677858] [2023-11-19 08:05:39,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 08:05:39,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-19 08:05:39,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:39,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-19 08:05:39,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2386, Unknown=0, NotChecked=0, Total=2550 [2023-11-19 08:05:39,240 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 45 states, 45 states have (on average 1.8) internal successors, (81), 41 states have internal predecessors, (81), 6 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-19 08:05:42,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:05:42,665 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2023-11-19 08:05:42,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-19 08:05:42,666 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.8) internal successors, (81), 41 states have internal predecessors, (81), 6 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2023-11-19 08:05:42,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:05:42,666 INFO L225 Difference]: With dead ends: 72 [2023-11-19 08:05:42,666 INFO L226 Difference]: Without dead ends: 0 [2023-11-19 08:05:42,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=527, Invalid=5953, Unknown=0, NotChecked=0, Total=6480 [2023-11-19 08:05:42,670 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 117 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-19 08:05:42,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 150 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-19 08:05:42,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-19 08:05:42,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-19 08:05:42,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2023-11-19 08:05:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-19 08:05:42,671 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2023-11-19 08:05:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:05:42,672 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-19 08:05:42,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.8) internal successors, (81), 41 states have internal predecessors, (81), 6 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-19 08:05:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-19 08:05:42,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-19 08:05:42,675 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 08:05:42,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-19 08:05:42,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:05:42,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-19 08:05:44,959 INFO L899 garLoopResultBuilder]: For program point insert_listEXIT(lines 791 802) no Hoare annotation was computed. [2023-11-19 08:05:44,959 INFO L899 garLoopResultBuilder]: For program point insert_listFINAL(lines 791 802) no Hoare annotation was computed. [2023-11-19 08:05:44,960 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 791 802) the Hoare annotation is: (or (not (= |old(~head~0.offset)| 0)) (and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= |#memory_int| |old(#memory_int)|) (= ~head~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2023-11-19 08:05:44,960 INFO L899 garLoopResultBuilder]: For program point L793(lines 793 799) no Hoare annotation was computed. [2023-11-19 08:05:44,960 INFO L899 garLoopResultBuilder]: For program point L793-2(lines 793 799) no Hoare annotation was computed. [2023-11-19 08:05:44,960 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2023-11-19 08:05:44,960 INFO L895 garLoopResultBuilder]: At program point L812-2(lines 812 814) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| ~head~0.base) 4))) (let ((.cse1 (select (select |#memory_$Pointer$.base| .cse0) 4))) (let ((.cse2 (select (select |#memory_$Pointer$.base| .cse1) 4))) (and (= (select (select |#memory_$Pointer$.offset| .cse0) 4) 0) (not (= .cse1 0)) (= (select |#valid| .cse0) 1) (= ~head~0.offset 0) (= (select (select |#memory_$Pointer$.offset| .cse1) 4) 0) (not (= .cse0 0)) (not (= .cse2 0)) (not (= .cse0 .cse2)) (= (select |#valid| ~head~0.base) 1) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) 4) 0) (not (= .cse1 .cse2)) (not (= ~head~0.base .cse2)) (= 2 (select (select |#memory_int| .cse2) 0)) (not (= ~head~0.base 0)))))) [2023-11-19 08:05:44,960 INFO L899 garLoopResultBuilder]: For program point L812-3(lines 812 814) no Hoare annotation was computed. [2023-11-19 08:05:44,960 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 803 823) no Hoare annotation was computed. [2023-11-19 08:05:44,961 INFO L895 garLoopResultBuilder]: At program point L808(line 808) the Hoare annotation is: (and (= ~head~0.offset 0) (= 2 (select (select |#memory_int| ~head~0.base) 0)) (= (select |#valid| ~head~0.base) 1) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) 4) 0) (not (= ~head~0.base 0))) [2023-11-19 08:05:44,961 INFO L899 garLoopResultBuilder]: For program point L808-1(line 808) no Hoare annotation was computed. [2023-11-19 08:05:44,961 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-19 08:05:44,961 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-19 08:05:44,961 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2023-11-19 08:05:44,961 INFO L899 garLoopResultBuilder]: For program point delete_list_returnLabel#1(lines 777 790) no Hoare annotation was computed. [2023-11-19 08:05:44,961 INFO L899 garLoopResultBuilder]: For program point L780(lines 780 786) no Hoare annotation was computed. [2023-11-19 08:05:44,961 INFO L899 garLoopResultBuilder]: For program point L780-1(lines 780 786) no Hoare annotation was computed. [2023-11-19 08:05:44,961 INFO L895 garLoopResultBuilder]: At program point L809(line 809) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| ~head~0.base) 4))) (and (= (select (select |#memory_$Pointer$.offset| .cse0) 4) 0) (= (select |#valid| .cse0) 1) (= (select (select |#memory_int| .cse0) 0) 2) (= ~head~0.offset 0) (not (= .cse0 0)) (= (select |#valid| ~head~0.base) 1) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) 4) 0) (not (= ~head~0.base .cse0)) (not (= ~head~0.base 0)))) [2023-11-19 08:05:44,961 INFO L899 garLoopResultBuilder]: For program point L809-1(line 809) no Hoare annotation was computed. [2023-11-19 08:05:44,961 INFO L899 garLoopResultBuilder]: For program point L772-1(line 772) no Hoare annotation was computed. [2023-11-19 08:05:44,962 INFO L899 garLoopResultBuilder]: For program point L772-3(lines 772 774) no Hoare annotation was computed. [2023-11-19 08:05:44,962 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-19 08:05:44,963 INFO L895 garLoopResultBuilder]: At program point L772-5(lines 772 774) the Hoare annotation is: (let ((.cse30 (select (select |#memory_$Pointer$.base| ~head~0.base) 4))) (let ((.cse29 (select (select |#memory_$Pointer$.base| .cse30) 4)) (.cse27 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) 4))) (let ((.cse26 (select (select |#memory_$Pointer$.base| .cse27) 4)) (.cse28 (select (select |#memory_$Pointer$.base| .cse29) 4))) (let ((.cse0 (= (select (select |#memory_$Pointer$.offset| .cse30) 4) 0)) (.cse1 (not (= .cse29 0))) (.cse2 (= (select |#valid| .cse30) 1)) (.cse3 (= |ULTIMATE.start_search_list_~l#1.offset| 0)) (.cse4 (= ~head~0.offset 0)) (.cse5 (= (select (select |#memory_$Pointer$.offset| .cse29) 4) 0)) (.cse6 (not (= .cse30 0))) (.cse7 (not (= .cse28 0))) (.cse8 (not (= .cse30 .cse28))) (.cse9 (not (= |ULTIMATE.start_search_list_~l#1.base| 0))) (.cse10 (= (select |#valid| ~head~0.base) 1)) (.cse11 (= |ULTIMATE.start_search_list_~k#1| 2)) (.cse24 (not (= .cse26 0))) (.cse12 (= (select (select |#memory_$Pointer$.offset| ~head~0.base) 4) 0)) (.cse13 (not (= .cse29 .cse28))) (.cse14 (not (= ~head~0.base .cse28))) (.cse18 (not (= .cse27 0))) (.cse19 (= 2 (select (select |#memory_int| .cse28) 0))) (.cse20 (not (= ~head~0.base 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (exists ((|v_ULTIMATE.start_search_list_~l#1.base_28| Int)) (let ((.cse16 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_28|) 4))) (let ((.cse15 (select (select |#memory_$Pointer$.base| .cse16) 4))) (let ((.cse17 (select (select |#memory_$Pointer$.base| .cse15) 4))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_28|) 4) 0) (= .cse15 |ULTIMATE.start_search_list_~l#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse15) 4) 0) (= (select (select |#memory_$Pointer$.offset| .cse16) 4) 0) (= 2 (select (select |#memory_int| .cse17) 0)) (not (= |v_ULTIMATE.start_search_list_~l#1.base_28| .cse17)) (not (= .cse16 .cse17)) (not (= .cse15 .cse17))))))) .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_ULTIMATE.start_search_list_~l#1.base_28| Int)) (let ((.cse21 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_28|) 4))) (let ((.cse22 (select (select |#memory_$Pointer$.base| .cse21) 4))) (let ((.cse23 (select (select |#memory_$Pointer$.base| .cse22) 4))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_28|) 4) 0) (= .cse21 |ULTIMATE.start_search_list_~l#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse22) 4) 0) (= (select (select |#memory_$Pointer$.offset| .cse21) 4) 0) (= 2 (select (select |#memory_int| .cse23) 0)) (not (= |v_ULTIMATE.start_search_list_~l#1.base_28| .cse23)) (not (= .cse21 .cse23)) (not (= .cse22 .cse23))))))) .cse10 .cse11 .cse24 .cse12 .cse13 .cse14 .cse18 .cse19 .cse20) (and (= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) 0) 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse20) (let ((.cse25 (select (select |#memory_$Pointer$.base| .cse26) 4))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= .cse25 0)) .cse8 .cse9 .cse10 .cse11 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) 4) 0) .cse24 .cse12 (= 2 (select (select |#memory_int| .cse25) 0)) .cse13 (= (select (select |#memory_$Pointer$.offset| .cse26) 4) 0) (= (select (select |#memory_$Pointer$.offset| .cse27) 4) 0) .cse14 .cse18 .cse19 .cse20 (not (= .cse25 .cse27)) (not (= .cse26 .cse25))))))))) [2023-11-19 08:05:44,963 INFO L899 garLoopResultBuilder]: For program point L772-6(lines 772 774) no Hoare annotation was computed. [2023-11-19 08:05:44,963 INFO L899 garLoopResultBuilder]: For program point L781-1(lines 781 783) no Hoare annotation was computed. [2023-11-19 08:05:44,963 INFO L895 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| ~head~0.base) 4))) (let ((.cse1 (select (select |#memory_$Pointer$.base| .cse0) 4))) (and (= (select (select |#memory_$Pointer$.offset| .cse0) 4) 0) (not (= .cse1 .cse0)) (not (= .cse1 0)) (= (select |#valid| .cse0) 1) (= (select |#valid| .cse1) 1) (= ~head~0.offset 0) (not (= .cse0 0)) (not (= ~head~0.base .cse1)) (= (select |#valid| ~head~0.base) 1) (= (select (select |#memory_int| .cse1) 0) 2) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) 4) 0) (not (= ~head~0.base 0))))) [2023-11-19 08:05:44,964 INFO L899 garLoopResultBuilder]: For program point search_list_returnLabel#1(lines 770 776) no Hoare annotation was computed. [2023-11-19 08:05:44,964 INFO L902 garLoopResultBuilder]: At program point L781-3(lines 781 783) the Hoare annotation is: true [2023-11-19 08:05:44,964 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-19 08:05:44,964 INFO L899 garLoopResultBuilder]: For program point L810-1(line 810) no Hoare annotation was computed. [2023-11-19 08:05:44,964 INFO L902 garLoopResultBuilder]: At program point L819-2(lines 819 821) the Hoare annotation is: true [2023-11-19 08:05:44,965 INFO L899 garLoopResultBuilder]: For program point L819-3(lines 819 821) no Hoare annotation was computed. [2023-11-19 08:05:44,965 INFO L899 garLoopResultBuilder]: For program point L14(lines 14 16) no Hoare annotation was computed. [2023-11-19 08:05:44,965 INFO L899 garLoopResultBuilder]: For program point L14-2(lines 13 18) no Hoare annotation was computed. [2023-11-19 08:05:44,966 INFO L895 garLoopResultBuilder]: At program point L807(line 807) the Hoare annotation is: (and (= ~head~0.offset 0) (or (and (= |ULTIMATE.start_main_~mylist~0#1.base| 0) (= |ULTIMATE.start_main_~mylist~0#1.offset| 0)) (not (= ~head~0.base 0)))) [2023-11-19 08:05:44,966 INFO L899 garLoopResultBuilder]: For program point L807-1(line 807) no Hoare annotation was computed. [2023-11-19 08:05:44,969 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2023-11-19 08:05:44,971 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 08:05:45,038 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-11-19 08:05:45,040 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-11-19 08:05:45,041 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[~head~0!base][4]] could not be translated [2023-11-19 08:05:45,041 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 08:05:45,042 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,042 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-19 08:05:45,042 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,042 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-19 08:05:45,042 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,043 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 08:05:45,044 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-19 08:05:45,044 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][4] could not be translated [2023-11-19 08:05:45,044 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-11-19 08:05:45,044 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,045 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,045 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_search_list_~l#1.base_28 : int :: ((((((#memory_$Pointer$.offset[v_ULTIMATE.start_search_list_~l#1.base_28][4] == 0 && #memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == ~l!base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4] == 0) && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == 0) && 2 == #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4]][0]) && !(v_ULTIMATE.start_search_list_~l#1.base_28 == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) && !(#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) could not be translated [2023-11-19 08:05:45,045 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~l!base][4] could not be translated [2023-11-19 08:05:45,046 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4]][0] could not be translated [2023-11-19 08:05:45,046 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-11-19 08:05:45,046 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-11-19 08:05:45,046 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[~head~0!base][4]] could not be translated [2023-11-19 08:05:45,047 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 08:05:45,047 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,047 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-19 08:05:45,048 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,048 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-19 08:05:45,048 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,048 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 08:05:45,049 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_search_list_~l#1.base_28 : int :: ((((((#memory_$Pointer$.offset[v_ULTIMATE.start_search_list_~l#1.base_28][4] == 0 && #memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4] == ~l!base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4] == 0) && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == 0) && 2 == #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4]][0]) && !(v_ULTIMATE.start_search_list_~l#1.base_28 == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) && !(#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) could not be translated [2023-11-19 08:05:45,049 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-19 08:05:45,049 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~l!base][4]][4] could not be translated [2023-11-19 08:05:45,049 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][4] could not be translated [2023-11-19 08:05:45,049 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-11-19 08:05:45,050 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,050 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,050 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~l!base][4] could not be translated [2023-11-19 08:05:45,050 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4]][0] could not be translated [2023-11-19 08:05:45,050 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~l!base][0] could not be translated [2023-11-19 08:05:45,051 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-11-19 08:05:45,051 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-11-19 08:05:45,051 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[~head~0!base][4]] could not be translated [2023-11-19 08:05:45,051 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 08:05:45,052 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,052 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-19 08:05:45,052 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,052 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-19 08:05:45,052 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,053 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 08:05:45,053 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-19 08:05:45,053 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][4] could not be translated [2023-11-19 08:05:45,053 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-11-19 08:05:45,053 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,054 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,054 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4]][0] could not be translated [2023-11-19 08:05:45,054 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-11-19 08:05:45,054 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-11-19 08:05:45,055 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[~head~0!base][4]] could not be translated [2023-11-19 08:05:45,055 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 08:05:45,055 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,055 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-19 08:05:45,056 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,056 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~l!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,056 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-19 08:05:45,056 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,057 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-19 08:05:45,057 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-19 08:05:45,057 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~l!base][4] could not be translated [2023-11-19 08:05:45,057 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~l!base][4]][4] could not be translated [2023-11-19 08:05:45,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][4] could not be translated [2023-11-19 08:05:45,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~l!base][4]][4]][4]][0] could not be translated [2023-11-19 08:05:45,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-11-19 08:05:45,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~l!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,059 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~l!base][4]][4] could not be translated [2023-11-19 08:05:45,059 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,059 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~l!base][4] could not be translated [2023-11-19 08:05:45,059 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4]][0] could not be translated [2023-11-19 08:05:45,060 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~l!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,060 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~l!base][4] could not be translated [2023-11-19 08:05:45,060 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~l!base][4]][4] could not be translated [2023-11-19 08:05:45,060 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~l!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,062 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-11-19 08:05:45,062 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-11-19 08:05:45,062 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[~head~0!base][4]] could not be translated [2023-11-19 08:05:45,063 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,063 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-19 08:05:45,063 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,063 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated [2023-11-19 08:05:45,063 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,064 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-19 08:05:45,064 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][4] could not be translated [2023-11-19 08:05:45,064 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated [2023-11-19 08:05:45,064 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,064 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated [2023-11-19 08:05:45,065 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4]][0] could not be translated [2023-11-19 08:05:45,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:05:45 BoogieIcfgContainer [2023-11-19 08:05:45,065 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 08:05:45,066 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 08:05:45,066 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 08:05:45,066 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 08:05:45,067 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:05:10" (3/4) ... [2023-11-19 08:05:45,069 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-19 08:05:45,073 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure insert_list [2023-11-19 08:05:45,079 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-19 08:05:45,079 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-19 08:05:45,080 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-19 08:05:45,080 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-19 08:05:45,177 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 08:05:45,177 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/witness.yml [2023-11-19 08:05:45,177 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 08:05:45,178 INFO L158 Benchmark]: Toolchain (without parser) took 35946.52ms. Allocated memory was 136.3MB in the beginning and 541.1MB in the end (delta: 404.8MB). Free memory was 87.7MB in the beginning and 492.5MB in the end (delta: -404.8MB). Peak memory consumption was 1.4MB. Max. memory is 16.1GB. [2023-11-19 08:05:45,178 INFO L158 Benchmark]: CDTParser took 0.98ms. Allocated memory is still 109.1MB. Free memory is still 60.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:05:45,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 705.00ms. Allocated memory is still 136.3MB. Free memory was 87.3MB in the beginning and 62.5MB in the end (delta: 24.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 08:05:45,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.62ms. Allocated memory is still 136.3MB. Free memory was 62.5MB in the beginning and 107.3MB in the end (delta: -44.9MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2023-11-19 08:05:45,180 INFO L158 Benchmark]: Boogie Preprocessor took 80.12ms. Allocated memory is still 136.3MB. Free memory was 107.3MB in the beginning and 107.9MB in the end (delta: -617.5kB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2023-11-19 08:05:45,180 INFO L158 Benchmark]: RCFGBuilder took 565.54ms. Allocated memory is still 136.3MB. Free memory was 107.9MB in the beginning and 92.0MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 08:05:45,181 INFO L158 Benchmark]: TraceAbstraction took 34378.61ms. Allocated memory was 136.3MB in the beginning and 541.1MB in the end (delta: 404.8MB). Free memory was 91.2MB in the beginning and 497.7MB in the end (delta: -406.5MB). Peak memory consumption was 308.0MB. Max. memory is 16.1GB. [2023-11-19 08:05:45,181 INFO L158 Benchmark]: Witness Printer took 111.57ms. Allocated memory is still 541.1MB. Free memory was 497.7MB in the beginning and 492.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-19 08:05:45,183 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.98ms. Allocated memory is still 109.1MB. Free memory is still 60.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 705.00ms. Allocated memory is still 136.3MB. Free memory was 87.3MB in the beginning and 62.5MB in the end (delta: 24.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.62ms. Allocated memory is still 136.3MB. Free memory was 62.5MB in the beginning and 107.3MB in the end (delta: -44.9MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.12ms. Allocated memory is still 136.3MB. Free memory was 107.3MB in the beginning and 107.9MB in the end (delta: -617.5kB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * RCFGBuilder took 565.54ms. Allocated memory is still 136.3MB. Free memory was 107.9MB in the beginning and 92.0MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 34378.61ms. Allocated memory was 136.3MB in the beginning and 541.1MB in the end (delta: 404.8MB). Free memory was 91.2MB in the beginning and 497.7MB in the end (delta: -406.5MB). Peak memory consumption was 308.0MB. Max. memory is 16.1GB. * Witness Printer took 111.57ms. Allocated memory is still 541.1MB. Free memory was 497.7MB in the beginning and 492.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_search_list_~l#1.base_28 : int :: ((((((#memory_$Pointer$.offset[v_ULTIMATE.start_search_list_~l#1.base_28][4] == 0 && #memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == ~l!base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4] == 0) && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == 0) && 2 == #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4]][0]) && !(v_ULTIMATE.start_search_list_~l#1.base_28 == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) && !(#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~l!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_search_list_~l#1.base_28 : int :: ((((((#memory_$Pointer$.offset[v_ULTIMATE.start_search_list_~l#1.base_28][4] == 0 && #memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4] == ~l!base) && #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4] == 0) && #memory_$Pointer$.offset[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == 0) && 2 == #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4]][0]) && !(v_ULTIMATE.start_search_list_~l#1.base_28 == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) && !(#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) && !(#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4] == #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[v_ULTIMATE.start_search_list_~l#1.base_28][4]][4]][4])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~l!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~l!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~l!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~l!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~l!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~l!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~l!base][4]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~l!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~l!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~l!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~l!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~l!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~l!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~l!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[#memory_$Pointer$.base[#memory_$Pointer$.base[~head~0!base][4]][4]][4]][0] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 15]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.2s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 657 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 657 mSDsluCounter, 1287 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1097 mSDsCounter, 176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2558 IncrementalHoareTripleChecker+Invalid, 2734 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 176 mSolverCounterUnsat, 190 mSDtfsCounter, 2558 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 729 GetRequests, 438 SyntacticMatches, 3 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3729 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=7, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 26 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 15 PreInvPairs, 29 NumberOfFragments, 1559 HoareAnnotationTreeSize, 15 FomulaSimplifications, 3365 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 3986 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 18.6s InterpolantComputationTime, 662 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 728 ConstructedInterpolants, 12 QuantifiedInterpolants, 9449 SizeOfPredicates, 66 NumberOfNonLiveVariables, 2630 ConjunctsInSsa, 359 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 468/670 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: ((((k == 2) || (k == 2)) || (k == 2)) || (k == 2)) - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 812]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 781]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-11-19 08:05:45,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ec0a227-d451-4f71-8be1-7efc0c8441ee/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE