./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 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_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bae9bfc842bb010963d083e19e9498cfd3af182f91f0b8fa56907786a4d462dd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:56:53,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:56:53,356 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 06:56:53,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:56:53,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:56:53,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:56:53,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:56:53,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:56:53,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:56:53,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:56:53,410 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:56:53,410 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:56:53,411 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:56:53,413 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:56:53,414 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:56:53,414 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:56:53,415 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:56:53,415 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:56:53,415 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:56:53,415 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:56:53,416 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:56:53,416 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:56:53,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:56:53,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:56:53,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:56:53,418 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:56:53,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:56:53,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:56:53,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:56:53,419 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:56:53,420 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:56:53,420 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:56:53,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:56:53,421 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:56:53,421 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:56:53,421 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:56:53,421 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:56:53,422 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:56:53,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:56:53,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:56:53,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:56:53,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:56:53,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:56:53,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:56:53,425 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:56:53,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:56:53,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:56:53,426 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:56:53,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:56:53,426 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/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_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> bae9bfc842bb010963d083e19e9498cfd3af182f91f0b8fa56907786a4d462dd [2024-11-09 06:56:53,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:56:53,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:56:53,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:56:53,739 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:56:53,740 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:56:53,741 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/sll2n_remove_all.i Unable to find full path for "g++" [2024-11-09 06:56:55,731 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:56:56,036 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:56:56,037 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/sv-benchmarks/c/list-simple/sll2n_remove_all.i [2024-11-09 06:56:56,063 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/data/4cfd936b2/8e2ed1cd189b4fce9ab285e35d9d811f/FLAGe15054833 [2024-11-09 06:56:56,335 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/data/4cfd936b2/8e2ed1cd189b4fce9ab285e35d9d811f [2024-11-09 06:56:56,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:56:56,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:56:56,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:56:56,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:56:56,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:56:56,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:56:56" (1/1) ... [2024-11-09 06:56:56,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d6e3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:56, skipping insertion in model container [2024-11-09 06:56:56,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:56:56" (1/1) ... [2024-11-09 06:56:56,409 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:56:56,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:56:56,778 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:56:56,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:56:56,863 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:56:56,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:56 WrapperNode [2024-11-09 06:56:56,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:56:56,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:56:56,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:56:56,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:56:56,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:56" (1/1) ... [2024-11-09 06:56:56,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:56" (1/1) ... [2024-11-09 06:56:56,908 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 86 [2024-11-09 06:56:56,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:56:56,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:56:56,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:56:56,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:56:56,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:56" (1/1) ... [2024-11-09 06:56:56,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:56" (1/1) ... [2024-11-09 06:56:56,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:56" (1/1) ... [2024-11-09 06:56:56,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:56" (1/1) ... [2024-11-09 06:56:56,931 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:56" (1/1) ... [2024-11-09 06:56:56,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:56" (1/1) ... [2024-11-09 06:56:56,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:56" (1/1) ... [2024-11-09 06:56:56,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:56" (1/1) ... [2024-11-09 06:56:56,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:56:56,940 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:56:56,940 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:56:56,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:56:56,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:56" (1/1) ... [2024-11-09 06:56:56,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:56:56,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:56:56,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:56:56,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:56:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:56:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:56:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:56:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:56:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:56:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:56:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:56:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 06:56:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:56:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:56:57,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:56:57,147 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:56:57,150 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:56:57,425 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-11-09 06:56:57,425 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:56:57,501 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:56:57,501 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:56:57,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:56:57 BoogieIcfgContainer [2024-11-09 06:56:57,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:56:57,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:56:57,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:56:57,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:56:57,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:56:56" (1/3) ... [2024-11-09 06:56:57,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18bdb744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:56:57, skipping insertion in model container [2024-11-09 06:56:57,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:56" (2/3) ... [2024-11-09 06:56:57,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18bdb744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:56:57, skipping insertion in model container [2024-11-09 06:56:57,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:56:57" (3/3) ... [2024-11-09 06:56:57,514 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all.i [2024-11-09 06:56:57,548 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:56:57,548 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-11-09 06:56:57,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:56:57,608 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@78ea52c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:56:57,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-09 06:56:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:57,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 06:56:57,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:57,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 06:56:57,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 06:56:57,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:57,631 INFO L85 PathProgramCache]: Analyzing trace with hash 118367620, now seen corresponding path program 1 times [2024-11-09 06:56:57,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:57,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674355549] [2024-11-09 06:56:57,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:57,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:57,944 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:57,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674355549] [2024-11-09 06:56:57,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674355549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:57,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:57,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:56:57,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161913126] [2024-11-09 06:56:57,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:57,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:57,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:57,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:58,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:58,002 INFO L87 Difference]: Start difference. First operand has 46 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 45 states have internal predecessors, (52), 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) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:58,080 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-11-09 06:56:58,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:58,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 06:56:58,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:58,091 INFO L225 Difference]: With dead ends: 58 [2024-11-09 06:56:58,091 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 06:56:58,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:58,098 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:58,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 76 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:56:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 06:56:58,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2024-11-09 06:56:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 24 states have (on average 2.0) internal successors, (48), 44 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:58,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2024-11-09 06:56:58,141 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 5 [2024-11-09 06:56:58,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:58,142 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2024-11-09 06:56:58,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:58,143 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2024-11-09 06:56:58,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 06:56:58,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:58,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 06:56:58,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:56:58,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 06:56:58,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:58,146 INFO L85 PathProgramCache]: Analyzing trace with hash 117477031, now seen corresponding path program 1 times [2024-11-09 06:56:58,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:58,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374514972] [2024-11-09 06:56:58,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:58,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:58,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:58,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:58,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374514972] [2024-11-09 06:56:58,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374514972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:58,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:58,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:56:58,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376026014] [2024-11-09 06:56:58,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:58,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:58,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:58,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:58,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:58,261 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:58,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:58,335 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-11-09 06:56:58,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:58,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 06:56:58,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:58,336 INFO L225 Difference]: With dead ends: 43 [2024-11-09 06:56:58,337 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 06:56:58,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:58,341 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:58,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:56:58,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 06:56:58,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-09 06:56:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:58,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2024-11-09 06:56:58,352 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 5 [2024-11-09 06:56:58,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:58,352 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2024-11-09 06:56:58,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2024-11-09 06:56:58,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 06:56:58,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:58,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 06:56:58,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:56:58,355 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 06:56:58,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:58,359 INFO L85 PathProgramCache]: Analyzing trace with hash 117477032, now seen corresponding path program 1 times [2024-11-09 06:56:58,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:58,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762340631] [2024-11-09 06:56:58,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:58,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:58,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:58,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:58,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762340631] [2024-11-09 06:56:58,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762340631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:58,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:58,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:56:58,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038247079] [2024-11-09 06:56:58,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:58,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:58,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:58,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:58,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:58,499 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:58,545 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2024-11-09 06:56:58,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:58,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 06:56:58,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:58,547 INFO L225 Difference]: With dead ends: 41 [2024-11-09 06:56:58,547 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 06:56:58,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:58,551 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:58,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 56 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:56:58,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 06:56:58,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 06:56:58,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-11-09 06:56:58,562 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 5 [2024-11-09 06:56:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:58,562 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-09 06:56:58,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:58,563 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-09 06:56:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:56:58,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:58,563 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:58,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:56:58,564 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 06:56:58,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:58,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1226279356, now seen corresponding path program 1 times [2024-11-09 06:56:58,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:58,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974221125] [2024-11-09 06:56:58,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:58,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:58,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:58,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974221125] [2024-11-09 06:56:58,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974221125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:58,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:58,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:56:58,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703467117] [2024-11-09 06:56:58,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:58,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:56:58,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:58,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:56:58,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:56:58,647 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:58,728 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2024-11-09 06:56:58,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:56:58,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 06:56:58,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:58,730 INFO L225 Difference]: With dead ends: 40 [2024-11-09 06:56:58,730 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 06:56:58,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:56:58,731 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:58,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 67 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:56:58,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 06:56:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 06:56:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2024-11-09 06:56:58,736 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 7 [2024-11-09 06:56:58,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:58,736 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-11-09 06:56:58,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:58,737 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2024-11-09 06:56:58,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:56:58,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:58,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:58,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:56:58,738 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 06:56:58,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:58,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1226279357, now seen corresponding path program 1 times [2024-11-09 06:56:58,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:58,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103151016] [2024-11-09 06:56:58,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:58,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:58,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:58,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:58,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103151016] [2024-11-09 06:56:58,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103151016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:58,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:58,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:56:58,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050969226] [2024-11-09 06:56:58,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:58,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:56:58,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:58,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:56:58,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:56:58,991 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:59,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:59,068 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-11-09 06:56:59,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:56:59,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 06:56:59,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:59,070 INFO L225 Difference]: With dead ends: 39 [2024-11-09 06:56:59,073 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 06:56:59,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:56:59,074 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:59,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:56:59,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 06:56:59,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-09 06:56:59,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.75) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:59,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-11-09 06:56:59,083 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 7 [2024-11-09 06:56:59,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:59,085 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-11-09 06:56:59,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:59,085 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-09 06:56:59,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:56:59,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:59,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:59,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:56:59,086 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 06:56:59,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:59,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2123064457, now seen corresponding path program 1 times [2024-11-09 06:56:59,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:59,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892516605] [2024-11-09 06:56:59,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:59,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:59,217 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:59,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892516605] [2024-11-09 06:56:59,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892516605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:56:59,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903335157] [2024-11-09 06:56:59,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:59,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:56:59,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:56:59,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:56:59,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:56:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:59,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:56:59,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:56:59,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:59,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:56:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:59,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903335157] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:56:59,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1016424686] [2024-11-09 06:56:59,469 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-09 06:56:59,470 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:56:59,474 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:56:59,481 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:56:59,481 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:57:01,643 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:57:14,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1016424686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:14,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:57:14,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [3, 3, 3] total 11 [2024-11-09 06:57:14,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494819609] [2024-11-09 06:57:14,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:14,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:57:14,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:57:14,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:57:14,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=100, Unknown=2, NotChecked=0, Total=132 [2024-11-09 06:57:14,202 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:17,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:57:19,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:19,592 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2024-11-09 06:57:19,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:57:19,593 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 06:57:19,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:19,594 INFO L225 Difference]: With dead ends: 56 [2024-11-09 06:57:19,594 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 06:57:19,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=30, Invalid=100, Unknown=2, NotChecked=0, Total=132 [2024-11-09 06:57:19,595 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:19,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 41 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 3 Unknown, 0 Unchecked, 5.4s Time] [2024-11-09 06:57:19,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 06:57:19,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2024-11-09 06:57:19,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.68) internal successors, (42), 39 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2024-11-09 06:57:19,600 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 11 [2024-11-09 06:57:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:19,601 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2024-11-09 06:57:19,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:19,601 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2024-11-09 06:57:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 06:57:19,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:19,602 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:19,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:57:19,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:57:19,805 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 06:57:19,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:19,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1390461061, now seen corresponding path program 1 times [2024-11-09 06:57:19,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:57:19,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90818579] [2024-11-09 06:57:19,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:19,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:57:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:19,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:19,875 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:57:19,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90818579] [2024-11-09 06:57:19,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90818579] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:57:19,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456805739] [2024-11-09 06:57:19,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:19,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:57:19,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:57:19,878 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:57:19,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:57:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:19,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:57:19,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:19,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:19,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:57:20,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:20,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456805739] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:57:20,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [326937404] [2024-11-09 06:57:20,022 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-09 06:57:20,022 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:57:20,022 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:57:20,023 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:57:20,023 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:57:21,232 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:57:35,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [326937404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:35,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:57:35,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [3, 3, 3] total 12 [2024-11-09 06:57:35,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741421323] [2024-11-09 06:57:35,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:35,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:57:35,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:57:35,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:57:35,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=121, Unknown=2, NotChecked=0, Total=156 [2024-11-09 06:57:35,390 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:37,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:57:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:39,656 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2024-11-09 06:57:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:57:39,657 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 06:57:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:39,657 INFO L225 Difference]: With dead ends: 51 [2024-11-09 06:57:39,657 INFO L226 Difference]: Without dead ends: 51 [2024-11-09 06:57:39,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=33, Invalid=121, Unknown=2, NotChecked=0, Total=156 [2024-11-09 06:57:39,658 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:39,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 49 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 3 Unknown, 0 Unchecked, 4.3s Time] [2024-11-09 06:57:39,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-09 06:57:39,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2024-11-09 06:57:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-11-09 06:57:39,663 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 12 [2024-11-09 06:57:39,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:39,663 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-11-09 06:57:39,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:39,664 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-11-09 06:57:39,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:57:39,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:39,664 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:39,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:57:39,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 06:57:39,865 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 06:57:39,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:39,866 INFO L85 PathProgramCache]: Analyzing trace with hash 154619951, now seen corresponding path program 1 times [2024-11-09 06:57:39,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:57:39,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486359858] [2024-11-09 06:57:39,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:39,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:57:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:39,939 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:57:39,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486359858] [2024-11-09 06:57:39,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486359858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:57:39,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170106294] [2024-11-09 06:57:39,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:39,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:57:39,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:57:39,945 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:57:39,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:57:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:40,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:57:40,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:40,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:40,073 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:57:40,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:40,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170106294] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:57:40,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [141064213] [2024-11-09 06:57:40,111 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2024-11-09 06:57:40,111 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:57:40,111 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:57:40,111 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:57:40,112 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:57:41,431 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:58:00,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [141064213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:00,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:58:00,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [3, 3, 3] total 13 [2024-11-09 06:58:00,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088552478] [2024-11-09 06:58:00,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:00,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:58:00,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:58:00,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:58:00,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=142, Unknown=4, NotChecked=0, Total=182 [2024-11-09 06:58:00,467 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:02,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:58:04,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:58:06,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:58:09,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:58:11,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:58:11,503 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2024-11-09 06:58:11,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:58:11,504 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 06:58:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:58:11,505 INFO L225 Difference]: With dead ends: 49 [2024-11-09 06:58:11,505 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 06:58:11,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=36, Invalid=142, Unknown=4, NotChecked=0, Total=182 [2024-11-09 06:58:11,506 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:58:11,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 55 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 5 Unknown, 0 Unchecked, 11.0s Time] [2024-11-09 06:58:11,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 06:58:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2024-11-09 06:58:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 42 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2024-11-09 06:58:11,512 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 13 [2024-11-09 06:58:11,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:58:11,512 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2024-11-09 06:58:11,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:11,512 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2024-11-09 06:58:11,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 06:58:11,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:58:11,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:11,530 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 06:58:11,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-09 06:58:11,714 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 06:58:11,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:11,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1734038434, now seen corresponding path program 1 times [2024-11-09 06:58:11,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:58:11,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504794049] [2024-11-09 06:58:11,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:11,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:11,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:58:11,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504794049] [2024-11-09 06:58:11,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504794049] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:58:11,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700504639] [2024-11-09 06:58:11,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:11,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:58:11,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:58:11,815 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:58:11,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:58:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:11,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:58:11,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:11,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:58:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:12,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700504639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:58:12,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1770775262] [2024-11-09 06:58:12,008 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-09 06:58:12,009 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:58:12,010 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:58:12,010 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:58:12,010 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:58:13,437 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:58:41,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1770775262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:41,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:58:41,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [3, 3, 3] total 15 [2024-11-09 06:58:41,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576936103] [2024-11-09 06:58:41,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:41,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:58:41,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:58:41,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:58:41,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=193, Unknown=4, NotChecked=0, Total=240 [2024-11-09 06:58:41,975 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:44,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:58:46,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:58:48,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:58:51,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:58:51,108 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2024-11-09 06:58:51,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:58:51,109 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 06:58:51,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:58:51,110 INFO L225 Difference]: With dead ends: 48 [2024-11-09 06:58:51,110 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 06:58:51,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=43, Invalid=193, Unknown=4, NotChecked=0, Total=240 [2024-11-09 06:58:51,111 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:58:51,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 54 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 293 Invalid, 4 Unknown, 0 Unchecked, 9.1s Time] [2024-11-09 06:58:51,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 06:58:51,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2024-11-09 06:58:51,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 43 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:51,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2024-11-09 06:58:51,116 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 15 [2024-11-09 06:58:51,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:58:51,116 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2024-11-09 06:58:51,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:51,117 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2024-11-09 06:58:51,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 06:58:51,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:58:51,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:51,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 06:58:51,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:58:51,321 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 06:58:51,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:51,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2079383484, now seen corresponding path program 1 times [2024-11-09 06:58:51,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:58:51,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434043579] [2024-11-09 06:58:51,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:51,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:51,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:58:51,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434043579] [2024-11-09 06:58:51,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434043579] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:58:51,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78445758] [2024-11-09 06:58:51,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:51,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:58:51,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:58:51,437 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:58:51,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 06:58:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:51,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:58:51,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:51,595 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:58:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:51,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78445758] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:58:51,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1123178807] [2024-11-09 06:58:51,640 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-09 06:58:51,642 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:58:51,642 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:58:51,643 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:58:51,643 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:58:53,153 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:59:23,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1123178807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:23,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:59:23,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [3, 3, 3] total 16 [2024-11-09 06:59:23,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009042408] [2024-11-09 06:59:23,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:23,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 06:59:23,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:59:23,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 06:59:23,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=219, Unknown=5, NotChecked=0, Total=272 [2024-11-09 06:59:23,423 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:25,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:59:28,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:59:31,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:59:32,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:59:32,757 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-11-09 06:59:32,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:59:32,757 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 06:59:32,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:59:32,758 INFO L225 Difference]: With dead ends: 46 [2024-11-09 06:59:32,758 INFO L226 Difference]: Without dead ends: 46 [2024-11-09 06:59:32,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 30.3s TimeCoverageRelationStatistics Valid=48, Invalid=219, Unknown=5, NotChecked=0, Total=272 [2024-11-09 06:59:32,759 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:59:32,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 52 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 5 Unknown, 0 Unchecked, 9.3s Time] [2024-11-09 06:59:32,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-09 06:59:32,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-09 06:59:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 45 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2024-11-09 06:59:32,763 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 16 [2024-11-09 06:59:32,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:59:32,763 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2024-11-09 06:59:32,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:32,764 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2024-11-09 06:59:32,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 06:59:32,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:59:32,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:32,790 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 06:59:32,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 06:59:32,966 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 06:59:32,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:32,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1127738431, now seen corresponding path program 1 times [2024-11-09 06:59:32,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:59:32,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732950294] [2024-11-09 06:59:32,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:32,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:33,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:33,055 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:59:33,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732950294] [2024-11-09 06:59:33,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732950294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:59:33,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578018531] [2024-11-09 06:59:33,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:33,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:59:33,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:59:33,058 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:59:33,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:59:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:33,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:59:33,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:59:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:33,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:59:33,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:33,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578018531] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:59:33,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1854501456] [2024-11-09 06:59:33,251 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 06:59:33,251 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:59:33,252 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:59:33,252 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:59:33,252 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:59:34,504 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:00:22,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1854501456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:22,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:00:22,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [3, 3, 3] total 17 [2024-11-09 07:00:22,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049282064] [2024-11-09 07:00:22,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:22,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:00:22,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:00:22,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:00:22,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=251, Unknown=9, NotChecked=0, Total=306 [2024-11-09 07:00:22,323 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:25,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:00:27,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:00:29,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:00:33,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:00:35,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:00:37,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:00:39,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:00:39,739 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2024-11-09 07:00:39,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:00:39,740 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:00:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:00:39,741 INFO L225 Difference]: With dead ends: 47 [2024-11-09 07:00:39,741 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 07:00:39,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 47.8s TimeCoverageRelationStatistics Valid=46, Invalid=251, Unknown=9, NotChecked=0, Total=306 [2024-11-09 07:00:39,742 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:00:39,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 426 Invalid, 7 Unknown, 0 Unchecked, 17.4s Time] [2024-11-09 07:00:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 07:00:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-09 07:00:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.53125) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2024-11-09 07:00:39,747 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 18 [2024-11-09 07:00:39,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:00:39,748 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2024-11-09 07:00:39,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2024-11-09 07:00:39,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:00:39,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:00:39,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:00:39,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 07:00:39,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 07:00:39,950 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:00:39,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:39,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1424910406, now seen corresponding path program 1 times [2024-11-09 07:00:39,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:00:39,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312615633] [2024-11-09 07:00:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:39,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:00:40,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:00:40,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312615633] [2024-11-09 07:00:40,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312615633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:00:40,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749094458] [2024-11-09 07:00:40,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:40,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:00:40,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:00:40,044 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:00:40,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:00:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:40,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:00:40,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:00:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:00:40,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:00:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:00:40,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749094458] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:00:40,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [109323510] [2024-11-09 07:00:40,244 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 07:00:40,244 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:00:40,245 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:00:40,245 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:00:40,245 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:00:46,776 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:02:15,146 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1742#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_19| Int)) (and (<= 2 |v_ULTIMATE.start_main_~#s~0#1.base_19|) (not (= 1 (select |#valid| |v_ULTIMATE.start_main_~#s~0#1.base_19|))))) (exists ((|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_117| (Array Int (Array Int Int))) (|v_#memory_int_111| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_remove_first_~head#1.base_27| Int)) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_sll_remove_first_~head#1.base_27| (store (select |v_#memory_$Pointer$.offset_117| |v_ULTIMATE.start_sll_remove_first_~head#1.base_27|) 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_remove_first_~head#1.base_27|) 0)))) (= (store |v_#memory_$Pointer$.base_117| |v_ULTIMATE.start_sll_remove_first_~head#1.base_27| (store (select |v_#memory_$Pointer$.base_117| |v_ULTIMATE.start_sll_remove_first_~head#1.base_27|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_remove_first_~head#1.base_27|) 0))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_111| |v_ULTIMATE.start_sll_remove_first_~head#1.base_27| (store (select |v_#memory_int_111| |v_ULTIMATE.start_sll_remove_first_~head#1.base_27|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_remove_first_~head#1.base_27|) 0)))) (= (select |#valid| |v_ULTIMATE.start_sll_remove_first_~head#1.base_27|) 1) (<= 2 |v_ULTIMATE.start_sll_remove_first_~head#1.base_27|) (<= 4 (select |#length| |v_ULTIMATE.start_sll_remove_first_~head#1.base_27|)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))' at error location [2024-11-09 07:02:15,146 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:02:15,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:02:15,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-09 07:02:15,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920375857] [2024-11-09 07:02:15,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:02:15,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:02:15,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:15,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:02:15,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=326, Unknown=34, NotChecked=0, Total=420 [2024-11-09 07:02:15,149 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:02:15,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:15,194 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2024-11-09 07:02:15,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:02:15,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 07:02:15,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:15,195 INFO L225 Difference]: With dead ends: 53 [2024-11-09 07:02:15,195 INFO L226 Difference]: Without dead ends: 53 [2024-11-09 07:02:15,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 88.4s TimeCoverageRelationStatistics Valid=60, Invalid=326, Unknown=34, NotChecked=0, Total=420 [2024-11-09 07:02:15,197 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:15,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 61 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:02:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-09 07:02:15,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-09 07:02:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:02:15,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2024-11-09 07:02:15,205 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 20 [2024-11-09 07:02:15,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:15,205 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2024-11-09 07:02:15,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:02:15,206 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2024-11-09 07:02:15,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:02:15,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:15,211 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:15,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 07:02:15,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 07:02:15,412 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:02:15,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:15,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1589338463, now seen corresponding path program 2 times [2024-11-09 07:02:15,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:15,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116364400] [2024-11-09 07:02:15,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:15,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:02:15,563 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:15,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116364400] [2024-11-09 07:02:15,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116364400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:02:15,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328022253] [2024-11-09 07:02:15,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:02:15,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:02:15,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:02:15,566 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:02:15,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acb1acfb-3f16-4836-a050-70bd9d68e265/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 07:02:15,711 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 07:02:15,711 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:02:15,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:02:15,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:02:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:02:15,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:02:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:02:15,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328022253] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:02:15,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1985034114] [2024-11-09 07:02:15,940 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 07:02:15,940 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:02:15,941 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:02:15,941 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:02:15,941 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:02:19,925 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:02:33,595 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (<= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse1 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse2 (<= 1 |c_#StackHeapBarrier|)) (.cse49 (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse62 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (let ((.cse14 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse15 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse19 (= (select |c_ULTIMATE.start_main_old_#valid#1| 2) 1)) (.cse27 (= (select |c_ULTIMATE.start_main_old_#valid#1| 1) 1)) (.cse28 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse21 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#s~0#1.base| 1))) (or (and .cse0 .cse1 .cse2 (exists ((|v_ULTIMATE.start_sll_remove_first_~head#1.base_31| Int) (|v_#memory_$Pointer$.base_136| (Array Int (Array Int Int))) (|v_#memory_int_130| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_136| (Array Int (Array Int Int)))) (let ((.cse48 (select |v_#memory_$Pointer$.base_136| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|)) (.cse46 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|) 0)) (.cse47 (select |v_#memory_$Pointer$.offset_136| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|)) (.cse45 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|) 0))) (and (<= 2 |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|) (= (select |c_#valid| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|) 1) (let ((.cse13 (select .cse48 0))) (let ((.cse3 (<= 8 (select |c_#length| .cse13))) (.cse20 (= (select .cse47 0) 0)) (.cse22 (= .cse46 (select (select |v_#memory_$Pointer$.base_136| .cse13) 4))) (.cse24 (<= (+ .cse13 1) |c_#StackHeapBarrier|)) (.cse25 (= .cse45 (select (select |v_#memory_$Pointer$.offset_136| .cse13) 4))) (.cse26 (= |v_ULTIMATE.start_sll_remove_first_~head#1.base_31| |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (let ((.cse5 (select (select |v_#memory_$Pointer$.base_136| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |v_#memory_$Pointer$.base_136| .cse5) 4))) (let ((.cse23 (store .cse21 .cse7 1))) (let ((.cse12 (store .cse23 .cse5 1))) (and .cse3 (exists ((|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_125| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int)))) (let ((.cse8 (select |v_#memory_$Pointer$.base_127| .cse7)) (.cse6 (select |v_#memory_$Pointer$.base_133| .cse5))) (and (= (let ((.cse4 (store |v_#memory_$Pointer$.base_127| .cse7 (store .cse8 4 0)))) (store .cse4 .cse5 (store (store (select .cse4 .cse5) 4 0) 0 (select .cse6 0)))) |v_#memory_$Pointer$.base_133|) (= (store |v_#memory_$Pointer$.base_125| .cse7 (store (store (select |v_#memory_$Pointer$.base_125| .cse7) 4 0) 0 (select .cse8 0))) |v_#memory_$Pointer$.base_127|) (= (store |v_#memory_$Pointer$.base_133| .cse5 (store .cse6 4 .cse7)) |v_#memory_$Pointer$.base_136|)))) (= (select (select |v_#memory_$Pointer$.offset_136| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= (+ .cse7 1) |c_#StackHeapBarrier|) (exists ((|v_#memory_int_119| (Array Int (Array Int Int))) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_126| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int)))) (let ((.cse10 (select |v_#memory_int_126| .cse5)) (.cse11 (select |v_#memory_int_120| .cse7)) (.cse9 (select |v_#memory_int_119| 1))) (and (= (select .cse9 1) 0) (= (store |v_#memory_int_126| .cse5 (store (store .cse10 0 1) 4 (select (select |v_#memory_int_130| .cse5) 4))) |v_#memory_int_130|) (= (store |v_#memory_int_125| .cse5 (store (select |v_#memory_int_125| .cse5) 4 (select .cse10 4))) |v_#memory_int_126|) (= (store |v_#memory_int_120| .cse7 (store (store .cse11 0 1) 4 (select (select |v_#memory_int_125| .cse7) 4))) |v_#memory_int_125|) (= (store |v_#memory_int_119| .cse7 (store (select |v_#memory_int_119| .cse7) 4 (select .cse11 4))) |v_#memory_int_120|) (= (select .cse9 0) 48)))) (= (select .cse12 .cse13) 1) (exists ((|v_#length_71| (Array Int Int))) (and (= (store (store (store |v_#length_71| |c_ULTIMATE.start_main_~#s~0#1.base| 4) .cse7 8) .cse5 8) |c_#length|) (= (select |v_#length_71| 2) 19) (= (select |v_#length_71| 1) 2))) .cse14 .cse15 (exists ((|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_125| (Array Int (Array Int Int)))) (let ((.cse16 (select |v_#memory_$Pointer$.offset_133| .cse5)) (.cse17 (select |v_#memory_$Pointer$.offset_127| .cse7))) (and (= (store |v_#memory_$Pointer$.offset_133| .cse5 (store .cse16 4 0)) |v_#memory_$Pointer$.offset_136|) (= (store |v_#memory_$Pointer$.offset_125| .cse7 (store (store (select |v_#memory_$Pointer$.offset_125| .cse7) 4 0) 0 (select .cse17 0))) |v_#memory_$Pointer$.offset_127|) (= (let ((.cse18 (store |v_#memory_$Pointer$.offset_127| .cse7 (store .cse17 4 0)))) (store .cse18 .cse5 (store (store (select .cse18 .cse5) 4 0) 0 (select .cse16 0)))) |v_#memory_$Pointer$.offset_133|)))) .cse19 (= |c_ULTIMATE.start_main_~i~0#1| 0) .cse20 (= (select .cse21 .cse7) 0) .cse22 (<= (+ 1 .cse5) |c_#StackHeapBarrier|) (= (select .cse12 |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|) 1) (not (= .cse7 0)) (= (select .cse23 .cse5) 0) .cse24 .cse25 .cse26 .cse27 (= |c_#valid| (store .cse12 .cse13 0)) (not (= 0 .cse5)) .cse28 (<= 8 (select |c_#length| .cse5))))))) (and .cse3 .cse14 .cse15 (exists ((|v_#memory_int_119| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int))) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_126| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int))) (|v_#length_71| (Array Int Int)) (|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_125| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_125| (Array Int (Array Int Int)))) (let ((.cse42 (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse31 (select .cse42 0))) (let ((.cse44 (select |v_#memory_$Pointer$.offset_133| .cse31)) (.cse33 (select (select |v_#memory_$Pointer$.base_134| .cse31) 4))) (let ((.cse32 (store .cse21 .cse33 1)) (.cse39 (store |v_#memory_$Pointer$.offset_133| .cse31 (store .cse44 4 0)))) (let ((.cse34 (select |v_#memory_$Pointer$.base_127| .cse33)) (.cse30 (select .cse39 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse37 (select |v_#memory_int_120| .cse33)) (.cse36 (select |v_#memory_$Pointer$.base_133| .cse31)) (.cse40 (select |v_#memory_$Pointer$.offset_127| .cse33)) (.cse38 (select |v_#memory_int_126| .cse31)) (.cse41 (select |v_#memory_int_119| 1)) (.cse29 (store .cse32 .cse31 0))) (and (= (select .cse29 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select .cse30 0)) (not (= .cse31 0)) (= (select .cse32 .cse31) 0) (= (store |v_#memory_$Pointer$.base_125| .cse33 (store (store (select |v_#memory_$Pointer$.base_125| .cse33) 4 0) 0 (select .cse34 0))) |v_#memory_$Pointer$.base_127|) (= (let ((.cse35 (store |v_#memory_$Pointer$.base_127| .cse33 (store .cse34 4 0)))) (store .cse35 .cse31 (store (store (select .cse35 .cse31) 4 0) 0 (select .cse36 0)))) |v_#memory_$Pointer$.base_133|) (= (select (store .cse32 .cse31 1) |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#memory_int_120| .cse33 (store (store .cse37 0 1) 4 (select (select |v_#memory_int_125| .cse33) 4))) |v_#memory_int_125|) (= (store |v_#memory_int_126| .cse31 (store (store .cse38 0 1) 4 (select (select |v_#memory_int_128| .cse31) 4))) |v_#memory_int_128|) (= (select .cse21 .cse33) 0) (= |v_#memory_$Pointer$.offset_136| (store .cse39 |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse30 0 0))) (<= 8 (select |c_#length| .cse31)) (not (= 0 .cse33)) (<= (+ .cse31 1) |c_#StackHeapBarrier|) (= (select .cse29 .cse13) 1) (= (store |v_#memory_$Pointer$.offset_125| .cse33 (store (store (select |v_#memory_$Pointer$.offset_125| .cse33) 4 0) 0 (select .cse40 0))) |v_#memory_$Pointer$.offset_127|) (= (store |v_#memory_int_119| .cse33 (store (select |v_#memory_int_119| .cse33) 4 (select .cse37 4))) |v_#memory_int_120|) (= (store (store (store |v_#length_71| |c_ULTIMATE.start_main_~#s~0#1.base| 4) .cse33 8) .cse31 8) |c_#length|) (= (select .cse41 1) 0) (= (store |v_#memory_$Pointer$.base_133| .cse31 (store .cse36 4 .cse33)) |v_#memory_$Pointer$.base_134|) (= (select |v_#length_71| 2) 19) (= (select |v_#length_71| 1) 2) (= |v_#memory_$Pointer$.base_136| (store |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse42 0 .cse33))) (= |v_#memory_$Pointer$.offset_133| (let ((.cse43 (store |v_#memory_$Pointer$.offset_127| .cse33 (store .cse40 4 0)))) (store .cse43 .cse31 (store (store (select .cse43 .cse31) 4 0) 0 (select .cse44 0))))) (<= (+ 1 .cse33) |c_#StackHeapBarrier|) (= (store |v_#memory_int_125| .cse31 (store (select |v_#memory_int_125| .cse31) 4 (select .cse38 4))) |v_#memory_int_126|) (= (select .cse29 |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|) 1) (= |v_#memory_int_130| (store |v_#memory_int_128| |c_ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_int_128| |c_ULTIMATE.start_main_~#s~0#1.base|) 0 (select (select |v_#memory_int_130| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= (select .cse41 0) 48) (= |c_#valid| (store .cse29 .cse13 0))))))))) .cse19 .cse20 .cse22 .cse24 .cse25 .cse26 .cse27 (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)) .cse28 (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) 0))))) (= (store |v_#memory_int_130| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31| (store (select |v_#memory_int_130| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|) 0 (select (select |c_#memory_int| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|) 0))) |c_#memory_int|) (<= 4 (select |c_#length| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|)) (= (store |v_#memory_$Pointer$.base_136| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31| (store .cse48 0 .cse46)) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_136| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31| (store .cse47 0 .cse45)))))) .cse49) (let ((.cse51 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse50 (select (select |c_#memory_$Pointer$.base| .cse51) 4))) (let ((.cse58 (store .cse21 .cse50 1))) (and (= (select .cse21 .cse50) 0) (<= (+ .cse51 1) |c_#StackHeapBarrier|) .cse1 .cse14 .cse15 .cse2 .cse19 (not (= .cse50 0)) (= (select |c_#valid| .cse51) 1) (<= (+ .cse50 1) |c_#StackHeapBarrier|) (not (= .cse51 0)) (exists ((|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_125| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int)))) (let ((.cse52 (select |v_#memory_$Pointer$.base_133| .cse51)) (.cse53 (select |v_#memory_$Pointer$.base_127| .cse50))) (and (= (store |v_#memory_$Pointer$.base_133| .cse51 (store .cse52 4 .cse50)) |c_#memory_$Pointer$.base|) (= |v_#memory_$Pointer$.base_127| (store |v_#memory_$Pointer$.base_125| .cse50 (store (store (select |v_#memory_$Pointer$.base_125| .cse50) 4 0) 0 (select .cse53 0)))) (= (let ((.cse54 (store |v_#memory_$Pointer$.base_127| .cse50 (store .cse53 4 0)))) (store .cse54 .cse51 (store (store (select .cse54 .cse51) 4 0) 0 (select .cse52 0)))) |v_#memory_$Pointer$.base_133|)))) (exists ((|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_125| (Array Int (Array Int Int)))) (let ((.cse55 (select |v_#memory_$Pointer$.offset_133| .cse51)) (.cse57 (select |v_#memory_$Pointer$.offset_127| .cse50))) (and (= (store |v_#memory_$Pointer$.offset_133| .cse51 (store .cse55 4 0)) |c_#memory_$Pointer$.offset|) (= (let ((.cse56 (store |v_#memory_$Pointer$.offset_127| .cse50 (store .cse57 4 0)))) (store .cse56 .cse51 (store (store (select .cse56 .cse51) 4 0) 0 (select .cse55 0)))) |v_#memory_$Pointer$.offset_133|) (= (store |v_#memory_$Pointer$.offset_125| .cse50 (store (store (select |v_#memory_$Pointer$.offset_125| .cse50) 4 0) 0 (select .cse57 0))) |v_#memory_$Pointer$.offset_127|)))) .cse27 (= |c_#valid| (store .cse58 .cse51 1)) .cse49 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#memory_int_119| (Array Int (Array Int Int))) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_126| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int)))) (let ((.cse59 (select |v_#memory_int_120| .cse50)) (.cse61 (select |v_#memory_int_126| .cse51)) (.cse60 (select |v_#memory_int_119| 1))) (and (= (store |v_#memory_int_120| .cse50 (store (store .cse59 0 1) 4 (select (select |v_#memory_int_125| .cse50) 4))) |v_#memory_int_125|) (= (select .cse60 1) 0) (= (store |v_#memory_int_119| .cse50 (store (select |v_#memory_int_119| .cse50) 4 (select .cse59 4))) |v_#memory_int_120|) (= (store |v_#memory_int_126| .cse51 (store (store .cse61 0 1) 4 (select (select |c_#memory_int| .cse51) 4))) |c_#memory_int|) (= (store |v_#memory_int_125| .cse51 (store (select |v_#memory_int_125| .cse51) 4 (select .cse61 4))) |v_#memory_int_126|) (= (select .cse60 0) 48)))) .cse28 (exists ((|v_#length_71| (Array Int Int))) (and (= (select |v_#length_71| 2) 19) (= (select |v_#length_71| 1) 2) (= (store (store (store |v_#length_71| |c_ULTIMATE.start_main_~#s~0#1.base| 4) .cse50 8) .cse51 8) |c_#length|))) (<= 8 (select |c_#length| .cse51)) (= (select .cse58 .cse51) 0) .cse62)))))) (or (and .cse0 .cse1 .cse2 .cse49) (and .cse1 .cse2 .cse49 .cse62)))) is different from false [2024-11-09 07:02:46,878 WARN L286 SmtUtils]: Spent 11.95s on a formula simplification. DAG size of input: 272 DAG size of output: 256 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 07:03:03,647 WARN L286 SmtUtils]: Spent 12.68s on a formula simplification. DAG size of input: 277 DAG size of output: 260 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 07:03:28,741 WARN L286 SmtUtils]: Spent 17.34s on a formula simplification. DAG size of input: 291 DAG size of output: 271 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 07:03:54,837 WARN L286 SmtUtils]: Spent 14.72s on a formula simplification. DAG size of input: 301 DAG size of output: 269 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 07:04:08,919 WARN L286 SmtUtils]: Spent 5.42s on a formula simplification. DAG size of input: 191 DAG size of output: 173 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 07:04:08,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1985034114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:08,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:04:08,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [4, 4, 4] total 22 [2024-11-09 07:04:08,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156337239] [2024-11-09 07:04:08,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:08,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:04:08,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:04:08,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:04:08,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=378, Unknown=13, NotChecked=40, Total=506 [2024-11-09 07:04:08,923 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:04:11,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:04:13,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:04:17,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:04:20,116 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse29 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse33 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#s~0#1.base| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse29) 4))) (let ((.cse79 (store .cse33 .cse1 1))) (let ((.cse34 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse0 (<= (+ .cse29 1) |c_#StackHeapBarrier|)) (.cse2 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse3 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse4 (= (select |c_ULTIMATE.start_main_old_#valid#1| 2) 1)) (.cse5 (not (= .cse1 0))) (.cse6 (<= (+ .cse1 1) |c_#StackHeapBarrier|)) (.cse7 (not (= .cse29 0))) (.cse8 (exists ((|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_125| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int)))) (let ((.cse86 (select |v_#memory_$Pointer$.base_133| .cse29)) (.cse87 (select |v_#memory_$Pointer$.base_127| .cse1))) (and (= (store |v_#memory_$Pointer$.base_133| .cse29 (store .cse86 4 .cse1)) |c_#memory_$Pointer$.base|) (= |v_#memory_$Pointer$.base_127| (store |v_#memory_$Pointer$.base_125| .cse1 (store (store (select |v_#memory_$Pointer$.base_125| .cse1) 4 0) 0 (select .cse87 0)))) (= (let ((.cse88 (store |v_#memory_$Pointer$.base_127| .cse1 (store .cse87 4 0)))) (store .cse88 .cse29 (store (store (select .cse88 .cse29) 4 0) 0 (select .cse86 0)))) |v_#memory_$Pointer$.base_133|))))) (.cse9 (exists ((|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_125| (Array Int (Array Int Int)))) (let ((.cse83 (select |v_#memory_$Pointer$.offset_133| .cse29)) (.cse85 (select |v_#memory_$Pointer$.offset_127| .cse1))) (and (= (store |v_#memory_$Pointer$.offset_133| .cse29 (store .cse83 4 0)) |c_#memory_$Pointer$.offset|) (= (let ((.cse84 (store |v_#memory_$Pointer$.offset_127| .cse1 (store .cse85 4 0)))) (store .cse84 .cse29 (store (store (select .cse84 .cse29) 4 0) 0 (select .cse83 0)))) |v_#memory_$Pointer$.offset_133|) (= (store |v_#memory_$Pointer$.offset_125| .cse1 (store (store (select |v_#memory_$Pointer$.offset_125| .cse1) 4 0) 0 (select .cse85 0))) |v_#memory_$Pointer$.offset_127|))))) (.cse10 (= (select |c_ULTIMATE.start_main_old_#valid#1| 1) 1)) (.cse11 (= |c_#valid| (store .cse79 .cse29 1))) (.cse12 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (.cse13 (exists ((|v_#memory_int_119| (Array Int (Array Int Int))) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_126| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int)))) (let ((.cse80 (select |v_#memory_int_120| .cse1)) (.cse82 (select |v_#memory_int_126| .cse29)) (.cse81 (select |v_#memory_int_119| 1))) (and (= (store |v_#memory_int_120| .cse1 (store (store .cse80 0 1) 4 (select (select |v_#memory_int_125| .cse1) 4))) |v_#memory_int_125|) (= (select .cse81 1) 0) (= (store |v_#memory_int_119| .cse1 (store (select |v_#memory_int_119| .cse1) 4 (select .cse80 4))) |v_#memory_int_120|) (= (store |v_#memory_int_126| .cse29 (store (store .cse82 0 1) 4 (select (select |c_#memory_int| .cse29) 4))) |c_#memory_int|) (= (store |v_#memory_int_125| .cse29 (store (select |v_#memory_int_125| .cse29) 4 (select .cse82 4))) |v_#memory_int_126|) (= (select .cse81 0) 48))))) (.cse14 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (exists ((|v_#length_71| (Array Int Int))) (and (= (select |v_#length_71| 2) 19) (= (select |v_#length_71| 1) 2) (= (store (store (store |v_#length_71| |c_ULTIMATE.start_main_~#s~0#1.base| 4) .cse1 8) .cse29 8) |c_#length|)))) (.cse16 (= (select .cse79 .cse29) 0)) (.cse35 (<= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse36 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse37 (<= 1 |c_#StackHeapBarrier|)) (.cse78 (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse17 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or (and .cse0 (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse1) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (exists ((|v_#memory_int_119| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int))) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_126| (Array Int (Array Int Int))) (|v_#length_71| (Array Int Int)) (|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_136| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_125| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int))) (|v_#memory_int_130| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_125| (Array Int (Array Int Int)))) (let ((.cse30 (select |v_#memory_$Pointer$.base_136| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse20 (select .cse30 0))) (let ((.cse18 (select (select |v_#memory_$Pointer$.base_136| .cse20) 4))) (let ((.cse22 (select |v_#memory_$Pointer$.base_127| .cse18)) (.cse21 (select |v_#memory_$Pointer$.base_133| .cse20)) (.cse23 (store .cse33 .cse18 1)) (.cse28 (select |v_#memory_int_126| .cse20)) (.cse31 (select |v_#memory_int_120| .cse18)) (.cse27 (select |v_#memory_$Pointer$.offset_133| .cse20)) (.cse24 (select |v_#memory_$Pointer$.offset_127| .cse18)) (.cse25 (select |v_#memory_int_119| 1))) (and (<= (+ .cse18 1) |c_#StackHeapBarrier|) (= (let ((.cse19 (store |v_#memory_$Pointer$.base_127| .cse18 (store .cse22 4 0)))) (store .cse19 .cse20 (store (store (select .cse19 .cse20) 4 0) 0 (select .cse21 0)))) |v_#memory_$Pointer$.base_133|) (= (store (store (store |v_#length_71| |c_ULTIMATE.start_main_~#s~0#1.base| 4) .cse18 8) .cse20 8) |c_#length|) (= (select (select |v_#memory_$Pointer$.offset_133| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_#valid| (store .cse23 .cse20 0)) (= (store |v_#memory_$Pointer$.offset_125| .cse18 (store (store (select |v_#memory_$Pointer$.offset_125| .cse18) 4 0) 0 (select .cse24 0))) |v_#memory_$Pointer$.offset_127|) (<= (+ 1 .cse20) |c_#StackHeapBarrier|) (= (select .cse25 1) 0) (= |c_#memory_$Pointer$.offset| (let ((.cse26 (store |v_#memory_$Pointer$.offset_133| .cse20 (store .cse27 4 0)))) (store .cse26 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~#s~0#1.base|) 0 0)))) (= (store |v_#memory_int_126| .cse20 (store (store .cse28 0 1) 4 (select (select |v_#memory_int_130| .cse20) 4))) |v_#memory_int_130|) (= (select |v_#length_71| 2) 19) (= (select |v_#length_71| 1) 2) (= .cse29 .cse18) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse18) 0) (= (store |v_#memory_$Pointer$.base_136| |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse30 0 .cse29)) |c_#memory_$Pointer$.base|) (not (= .cse18 0)) (= (store |v_#memory_$Pointer$.base_125| .cse18 (store (store (select |v_#memory_$Pointer$.base_125| .cse18) 4 0) 0 (select .cse22 0))) |v_#memory_$Pointer$.base_127|) (= (store |v_#memory_$Pointer$.base_133| .cse20 (store .cse21 4 .cse18)) |v_#memory_$Pointer$.base_136|) (= (select .cse23 .cse20) 0) (= (store |v_#memory_int_125| .cse20 (store (select |v_#memory_int_125| .cse20) 4 (select .cse28 4))) |v_#memory_int_126|) (= (store |v_#memory_int_120| .cse18 (store (store .cse31 0 1) 4 (select (select |v_#memory_int_125| .cse18) 4))) |v_#memory_int_125|) (= (store |v_#memory_int_119| .cse18 (store (select |v_#memory_int_119| .cse18) 4 (select .cse31 4))) |v_#memory_int_120|) (not (= 0 .cse20)) (= |c_#memory_int| (store |v_#memory_int_130| |c_ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_int_130| |c_ULTIMATE.start_main_~#s~0#1.base|) 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= (let ((.cse32 (store |v_#memory_$Pointer$.offset_127| .cse18 (store .cse24 4 0)))) (store .cse32 .cse20 (store (store (select .cse32 .cse20) 4 0) 0 (select .cse27 0)))) |v_#memory_$Pointer$.offset_133|) (= (select .cse25 0) 48))))))) .cse2 .cse3 .cse4 .cse34 .cse10 .cse14)) (or (and .cse35 .cse36 .cse37 (exists ((|v_ULTIMATE.start_sll_remove_first_~head#1.base_31| Int) (|v_#memory_$Pointer$.base_136| (Array Int (Array Int Int))) (|v_#memory_int_130| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_136| (Array Int (Array Int Int)))) (let ((.cse77 (select |v_#memory_$Pointer$.base_136| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|)) (.cse75 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|) 0)) (.cse76 (select |v_#memory_$Pointer$.offset_136| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|)) (.cse74 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|) 0))) (and (<= 2 |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|) (= (select |c_#valid| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|) 1) (let ((.cse48 (select .cse77 0))) (let ((.cse38 (<= 8 (select |c_#length| .cse48))) (.cse52 (= (select .cse76 0) 0)) (.cse53 (= .cse75 (select (select |v_#memory_$Pointer$.base_136| .cse48) 4))) (.cse55 (<= (+ .cse48 1) |c_#StackHeapBarrier|)) (.cse56 (= .cse74 (select (select |v_#memory_$Pointer$.offset_136| .cse48) 4))) (.cse57 (= |v_ULTIMATE.start_sll_remove_first_~head#1.base_31| |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (let ((.cse40 (select (select |v_#memory_$Pointer$.base_136| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse42 (select (select |v_#memory_$Pointer$.base_136| .cse40) 4))) (let ((.cse54 (store .cse33 .cse42 1))) (let ((.cse47 (store .cse54 .cse40 1))) (and .cse38 (exists ((|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_125| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int)))) (let ((.cse43 (select |v_#memory_$Pointer$.base_127| .cse42)) (.cse41 (select |v_#memory_$Pointer$.base_133| .cse40))) (and (= (let ((.cse39 (store |v_#memory_$Pointer$.base_127| .cse42 (store .cse43 4 0)))) (store .cse39 .cse40 (store (store (select .cse39 .cse40) 4 0) 0 (select .cse41 0)))) |v_#memory_$Pointer$.base_133|) (= (store |v_#memory_$Pointer$.base_125| .cse42 (store (store (select |v_#memory_$Pointer$.base_125| .cse42) 4 0) 0 (select .cse43 0))) |v_#memory_$Pointer$.base_127|) (= (store |v_#memory_$Pointer$.base_133| .cse40 (store .cse41 4 .cse42)) |v_#memory_$Pointer$.base_136|)))) (= (select (select |v_#memory_$Pointer$.offset_136| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= (+ .cse42 1) |c_#StackHeapBarrier|) (exists ((|v_#memory_int_119| (Array Int (Array Int Int))) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_126| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int)))) (let ((.cse45 (select |v_#memory_int_126| .cse40)) (.cse46 (select |v_#memory_int_120| .cse42)) (.cse44 (select |v_#memory_int_119| 1))) (and (= (select .cse44 1) 0) (= (store |v_#memory_int_126| .cse40 (store (store .cse45 0 1) 4 (select (select |v_#memory_int_130| .cse40) 4))) |v_#memory_int_130|) (= (store |v_#memory_int_125| .cse40 (store (select |v_#memory_int_125| .cse40) 4 (select .cse45 4))) |v_#memory_int_126|) (= (store |v_#memory_int_120| .cse42 (store (store .cse46 0 1) 4 (select (select |v_#memory_int_125| .cse42) 4))) |v_#memory_int_125|) (= (store |v_#memory_int_119| .cse42 (store (select |v_#memory_int_119| .cse42) 4 (select .cse46 4))) |v_#memory_int_120|) (= (select .cse44 0) 48)))) (= (select .cse47 .cse48) 1) (exists ((|v_#length_71| (Array Int Int))) (and (= (store (store (store |v_#length_71| |c_ULTIMATE.start_main_~#s~0#1.base| 4) .cse42 8) .cse40 8) |c_#length|) (= (select |v_#length_71| 2) 19) (= (select |v_#length_71| 1) 2))) .cse2 .cse3 (exists ((|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_125| (Array Int (Array Int Int)))) (let ((.cse49 (select |v_#memory_$Pointer$.offset_133| .cse40)) (.cse50 (select |v_#memory_$Pointer$.offset_127| .cse42))) (and (= (store |v_#memory_$Pointer$.offset_133| .cse40 (store .cse49 4 0)) |v_#memory_$Pointer$.offset_136|) (= (store |v_#memory_$Pointer$.offset_125| .cse42 (store (store (select |v_#memory_$Pointer$.offset_125| .cse42) 4 0) 0 (select .cse50 0))) |v_#memory_$Pointer$.offset_127|) (= (let ((.cse51 (store |v_#memory_$Pointer$.offset_127| .cse42 (store .cse50 4 0)))) (store .cse51 .cse40 (store (store (select .cse51 .cse40) 4 0) 0 (select .cse49 0)))) |v_#memory_$Pointer$.offset_133|)))) .cse4 .cse34 .cse52 (= (select .cse33 .cse42) 0) .cse53 (<= (+ 1 .cse40) |c_#StackHeapBarrier|) (= (select .cse47 |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|) 1) (not (= .cse42 0)) (= (select .cse54 .cse40) 0) .cse55 .cse56 .cse57 .cse10 (= |c_#valid| (store .cse47 .cse48 0)) (not (= 0 .cse40)) .cse14 (<= 8 (select |c_#length| .cse40))))))) (and .cse38 .cse2 .cse3 (exists ((|v_#memory_int_119| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int))) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_126| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int))) (|v_#length_71| (Array Int Int)) (|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_125| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int))) (|v_#memory_int_120| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_125| (Array Int (Array Int Int)))) (let ((.cse71 (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse60 (select .cse71 0))) (let ((.cse73 (select |v_#memory_$Pointer$.offset_133| .cse60)) (.cse62 (select (select |v_#memory_$Pointer$.base_134| .cse60) 4))) (let ((.cse61 (store .cse33 .cse62 1)) (.cse68 (store |v_#memory_$Pointer$.offset_133| .cse60 (store .cse73 4 0)))) (let ((.cse63 (select |v_#memory_$Pointer$.base_127| .cse62)) (.cse59 (select .cse68 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse66 (select |v_#memory_int_120| .cse62)) (.cse65 (select |v_#memory_$Pointer$.base_133| .cse60)) (.cse69 (select |v_#memory_$Pointer$.offset_127| .cse62)) (.cse67 (select |v_#memory_int_126| .cse60)) (.cse70 (select |v_#memory_int_119| 1)) (.cse58 (store .cse61 .cse60 0))) (and (= (select .cse58 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= 0 (select .cse59 0)) (not (= .cse60 0)) (= (select .cse61 .cse60) 0) (= (store |v_#memory_$Pointer$.base_125| .cse62 (store (store (select |v_#memory_$Pointer$.base_125| .cse62) 4 0) 0 (select .cse63 0))) |v_#memory_$Pointer$.base_127|) (= (let ((.cse64 (store |v_#memory_$Pointer$.base_127| .cse62 (store .cse63 4 0)))) (store .cse64 .cse60 (store (store (select .cse64 .cse60) 4 0) 0 (select .cse65 0)))) |v_#memory_$Pointer$.base_133|) (= (select (store .cse61 .cse60 1) |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#memory_int_120| .cse62 (store (store .cse66 0 1) 4 (select (select |v_#memory_int_125| .cse62) 4))) |v_#memory_int_125|) (= (store |v_#memory_int_126| .cse60 (store (store .cse67 0 1) 4 (select (select |v_#memory_int_128| .cse60) 4))) |v_#memory_int_128|) (= (select .cse33 .cse62) 0) (= |v_#memory_$Pointer$.offset_136| (store .cse68 |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse59 0 0))) (<= 8 (select |c_#length| .cse60)) (not (= 0 .cse62)) (<= (+ .cse60 1) |c_#StackHeapBarrier|) (= (select .cse58 .cse48) 1) (= (store |v_#memory_$Pointer$.offset_125| .cse62 (store (store (select |v_#memory_$Pointer$.offset_125| .cse62) 4 0) 0 (select .cse69 0))) |v_#memory_$Pointer$.offset_127|) (= (store |v_#memory_int_119| .cse62 (store (select |v_#memory_int_119| .cse62) 4 (select .cse66 4))) |v_#memory_int_120|) (= (store (store (store |v_#length_71| |c_ULTIMATE.start_main_~#s~0#1.base| 4) .cse62 8) .cse60 8) |c_#length|) (= (select .cse70 1) 0) (= (store |v_#memory_$Pointer$.base_133| .cse60 (store .cse65 4 .cse62)) |v_#memory_$Pointer$.base_134|) (= (select |v_#length_71| 2) 19) (= (select |v_#length_71| 1) 2) (= |v_#memory_$Pointer$.base_136| (store |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse71 0 .cse62))) (= |v_#memory_$Pointer$.offset_133| (let ((.cse72 (store |v_#memory_$Pointer$.offset_127| .cse62 (store .cse69 4 0)))) (store .cse72 .cse60 (store (store (select .cse72 .cse60) 4 0) 0 (select .cse73 0))))) (<= (+ 1 .cse62) |c_#StackHeapBarrier|) (= (store |v_#memory_int_125| .cse60 (store (select |v_#memory_int_125| .cse60) 4 (select .cse67 4))) |v_#memory_int_126|) (= (select .cse58 |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|) 1) (= |v_#memory_int_130| (store |v_#memory_int_128| |c_ULTIMATE.start_main_~#s~0#1.base| (store (select |v_#memory_int_128| |c_ULTIMATE.start_main_~#s~0#1.base|) 0 (select (select |v_#memory_int_130| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= (select .cse70 0) 48) (= |c_#valid| (store .cse58 .cse48 0))))))))) .cse4 .cse52 .cse53 .cse55 .cse56 .cse57 .cse10 (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)) .cse14 (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) 0))))) (= (store |v_#memory_int_130| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31| (store (select |v_#memory_int_130| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|) 0 (select (select |c_#memory_int| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|) 0))) |c_#memory_int|) (<= 4 (select |c_#length| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31|)) (= (store |v_#memory_$Pointer$.base_136| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31| (store .cse77 0 .cse75)) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_136| |v_ULTIMATE.start_sll_remove_first_~head#1.base_31| (store .cse76 0 .cse74)))))) .cse78) (and (= (select .cse33 .cse1) 0) .cse0 .cse36 .cse2 .cse3 .cse37 .cse4 .cse5 (= (select |c_#valid| .cse29) 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse78 .cse12 .cse13 .cse14 .cse15 (<= 8 (select |c_#length| .cse29)) .cse16 .cse17)) .cse36 .cse37 (or (and .cse35 .cse36 .cse37 .cse78) (and .cse36 .cse37 .cse78 .cse17))))))) is different from false [2024-11-09 07:04:22,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]