./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-broom/sll-fst-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/sll-fst-shared.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2 --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 64bit --witnessprinter.graph.data.programhash b71f005f6b63440309c4e24d3866ac559942cc4e42efba34dd3f9c28733bd7e5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 12:39:16,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 12:39:16,375 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2024-11-02 12:39:16,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 12:39:16,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 12:39:16,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 12:39:16,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 12:39:16,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 12:39:16,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 12:39:16,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 12:39:16,409 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 12:39:16,409 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 12:39:16,410 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 12:39:16,410 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-02 12:39:16,411 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 12:39:16,411 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 12:39:16,411 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-02 12:39:16,412 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-02 12:39:16,414 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 12:39:16,415 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-02 12:39:16,416 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-02 12:39:16,420 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-02 12:39:16,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 12:39:16,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 12:39:16,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 12:39:16,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 12:39:16,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 12:39:16,423 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-02 12:39:16,423 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-02 12:39:16,423 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-02 12:39:16,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 12:39:16,424 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 12:39:16,424 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 12:39:16,424 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-02 12:39:16,425 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 12:39:16,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 12:39:16,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 12:39:16,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 12:39:16,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:39:16,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 12:39:16,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 12:39:16,428 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-02 12:39:16,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-02 12:39:16,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 12:39:16,429 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 12:39:16,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 12:39:16,430 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_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/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_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b71f005f6b63440309c4e24d3866ac559942cc4e42efba34dd3f9c28733bd7e5 [2024-11-02 12:39:16,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 12:39:16,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 12:39:16,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 12:39:16,718 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 12:39:16,719 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 12:39:16,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/memsafety-broom/sll-fst-shared.i Unable to find full path for "g++" [2024-11-02 12:39:18,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 12:39:19,204 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 12:39:19,205 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/sv-benchmarks/c/memsafety-broom/sll-fst-shared.i [2024-11-02 12:39:19,255 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/data/be1cf9c30/801331f963a9479d9ae6785817f18f24/FLAGd88ee1368 [2024-11-02 12:39:19,276 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/data/be1cf9c30/801331f963a9479d9ae6785817f18f24 [2024-11-02 12:39:19,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 12:39:19,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 12:39:19,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 12:39:19,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 12:39:19,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 12:39:19,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:39:19" (1/1) ... [2024-11-02 12:39:19,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a916126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:19, skipping insertion in model container [2024-11-02 12:39:19,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:39:19" (1/1) ... [2024-11-02 12:39:19,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 12:39:19,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:39:19,759 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 12:39:19,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:39:19,882 INFO L204 MainTranslator]: Completed translation [2024-11-02 12:39:19,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:19 WrapperNode [2024-11-02 12:39:19,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 12:39:19,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 12:39:19,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 12:39:19,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 12:39:19,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:19" (1/1) ... [2024-11-02 12:39:19,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:19" (1/1) ... [2024-11-02 12:39:19,939 INFO L138 Inliner]: procedures = 121, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 74 [2024-11-02 12:39:19,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 12:39:19,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 12:39:19,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 12:39:19,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 12:39:19,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:19" (1/1) ... [2024-11-02 12:39:19,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:19" (1/1) ... [2024-11-02 12:39:19,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:19" (1/1) ... [2024-11-02 12:39:19,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:19" (1/1) ... [2024-11-02 12:39:19,971 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:19" (1/1) ... [2024-11-02 12:39:19,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:19" (1/1) ... [2024-11-02 12:39:19,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:19" (1/1) ... [2024-11-02 12:39:19,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:19" (1/1) ... [2024-11-02 12:39:19,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 12:39:19,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 12:39:19,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 12:39:19,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 12:39:19,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:19" (1/1) ... [2024-11-02 12:39:19,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:39:20,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:39:20,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-02 12:39:20,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-02 12:39:20,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-02 12:39:20,061 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-02 12:39:20,061 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-02 12:39:20,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-02 12:39:20,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-02 12:39:20,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-02 12:39:20,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-02 12:39:20,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 12:39:20,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 12:39:20,210 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 12:39:20,213 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 12:39:20,575 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-02 12:39:20,575 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 12:39:20,651 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 12:39:20,652 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-02 12:39:20,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:39:20 BoogieIcfgContainer [2024-11-02 12:39:20,652 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 12:39:20,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 12:39:20,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 12:39:20,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 12:39:20,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:39:19" (1/3) ... [2024-11-02 12:39:20,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2209f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:39:20, skipping insertion in model container [2024-11-02 12:39:20,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:39:19" (2/3) ... [2024-11-02 12:39:20,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2209f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:39:20, skipping insertion in model container [2024-11-02 12:39:20,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:39:20" (3/3) ... [2024-11-02 12:39:20,663 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-fst-shared.i [2024-11-02 12:39:20,686 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 12:39:20,686 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-11-02 12:39:20,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 12:39:20,753 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;@48c8d58c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 12:39:20,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-11-02 12:39:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 27 states have (on average 2.259259259259259) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:39:20,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-02 12:39:20,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:39:20,767 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-02 12:39:20,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-02 12:39:20,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:39:20,774 INFO L85 PathProgramCache]: Analyzing trace with hash 4876116, now seen corresponding path program 1 times [2024-11-02 12:39:20,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:39:20,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21065405] [2024-11-02 12:39:20,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:39:20,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:39:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:39:21,086 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-02 12:39:21,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:39:21,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21065405] [2024-11-02 12:39:21,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21065405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:39:21,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:39:21,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 12:39:21,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776963038] [2024-11-02 12:39:21,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:39:21,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:39:21,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:39:21,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:39:21,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:39:21,132 INFO L87 Difference]: Start difference. First operand has 60 states, 27 states have (on average 2.259259259259259) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:39:21,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:39:21,227 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2024-11-02 12:39:21,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:39:21,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-02 12:39:21,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:39:21,237 INFO L225 Difference]: With dead ends: 59 [2024-11-02 12:39:21,237 INFO L226 Difference]: Without dead ends: 58 [2024-11-02 12:39:21,239 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-02 12:39:21,243 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:39:21,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:39:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-02 12:39:21,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-02 12:39:21,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:39:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2024-11-02 12:39:21,283 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 4 [2024-11-02 12:39:21,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:39:21,284 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-11-02 12:39:21,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:39:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2024-11-02 12:39:21,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-02 12:39:21,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:39:21,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-02 12:39:21,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 12:39:21,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-02 12:39:21,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:39:21,287 INFO L85 PathProgramCache]: Analyzing trace with hash 4876117, now seen corresponding path program 1 times [2024-11-02 12:39:21,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:39:21,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100994850] [2024-11-02 12:39:21,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:39:21,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:39:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:39:21,420 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-02 12:39:21,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:39:21,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100994850] [2024-11-02 12:39:21,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100994850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:39:21,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:39:21,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 12:39:21,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993706315] [2024-11-02 12:39:21,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:39:21,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:39:21,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:39:21,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:39:21,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:39:21,426 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:39:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:39:21,517 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2024-11-02 12:39:21,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:39:21,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-02 12:39:21,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:39:21,519 INFO L225 Difference]: With dead ends: 57 [2024-11-02 12:39:21,519 INFO L226 Difference]: Without dead ends: 57 [2024-11-02 12:39:21,519 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-02 12:39:21,520 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:39:21,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:39:21,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-02 12:39:21,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-02 12:39:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 27 states have (on average 2.111111111111111) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:39:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2024-11-02 12:39:21,527 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 4 [2024-11-02 12:39:21,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:39:21,527 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2024-11-02 12:39:21,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:39:21,528 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2024-11-02 12:39:21,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-02 12:39:21,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:39:21,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:39:21,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 12:39:21,529 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-02 12:39:21,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:39:21,530 INFO L85 PathProgramCache]: Analyzing trace with hash -760919924, now seen corresponding path program 1 times [2024-11-02 12:39:21,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:39:21,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812386482] [2024-11-02 12:39:21,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:39:21,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:39:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:39:21,617 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-02 12:39:21,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:39:21,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812386482] [2024-11-02 12:39:21,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812386482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:39:21,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:39:21,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 12:39:21,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193505151] [2024-11-02 12:39:21,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:39:21,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:39:21,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:39:21,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:39:21,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:39:21,621 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:39:21,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:39:21,715 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2024-11-02 12:39:21,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:39:21,715 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2024-11-02 12:39:21,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:39:21,717 INFO L225 Difference]: With dead ends: 60 [2024-11-02 12:39:21,718 INFO L226 Difference]: Without dead ends: 60 [2024-11-02 12:39:21,720 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-02 12:39:21,722 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:39:21,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:39:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-02 12:39:21,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-11-02 12:39:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 27 states have (on average 2.074074074074074) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:39:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2024-11-02 12:39:21,736 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 7 [2024-11-02 12:39:21,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:39:21,736 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2024-11-02 12:39:21,736 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:39:21,736 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2024-11-02 12:39:21,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-02 12:39:21,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:39:21,739 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:39:21,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 12:39:21,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-02 12:39:21,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:39:21,741 INFO L85 PathProgramCache]: Analyzing trace with hash -760919923, now seen corresponding path program 1 times [2024-11-02 12:39:21,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:39:21,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343209444] [2024-11-02 12:39:21,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:39:21,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:39:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:39:21,939 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-02 12:39:21,939 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:39:21,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343209444] [2024-11-02 12:39:21,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343209444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:39:21,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:39:21,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 12:39:21,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357495706] [2024-11-02 12:39:21,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:39:21,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:39:21,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:39:21,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:39:21,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:39:21,944 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:39:22,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:39:22,016 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2024-11-02 12:39:22,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:39:22,018 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2024-11-02 12:39:22,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:39:22,019 INFO L225 Difference]: With dead ends: 59 [2024-11-02 12:39:22,019 INFO L226 Difference]: Without dead ends: 59 [2024-11-02 12:39:22,020 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-02 12:39:22,021 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:39:22,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:39:22,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-02 12:39:22,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-11-02 12:39:22,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 27 states have (on average 2.037037037037037) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:39:22,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2024-11-02 12:39:22,037 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 7 [2024-11-02 12:39:22,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:39:22,037 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-11-02 12:39:22,037 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:39:22,037 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2024-11-02 12:39:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-02 12:39:22,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:39:22,038 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:39:22,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 12:39:22,039 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-02 12:39:22,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:39:22,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2113677552, now seen corresponding path program 1 times [2024-11-02 12:39:22,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:39:22,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015201481] [2024-11-02 12:39:22,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:39:22,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:39:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:39:22,281 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-02 12:39:22,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:39:22,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015201481] [2024-11-02 12:39:22,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015201481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:39:22,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:39:22,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:39:22,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889734817] [2024-11-02 12:39:22,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:39:22,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:39:22,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:39:22,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:39:22,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:39:22,287 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:39:22,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:39:22,442 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-11-02 12:39:22,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 12:39:22,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-11-02 12:39:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:39:22,443 INFO L225 Difference]: With dead ends: 56 [2024-11-02 12:39:22,443 INFO L226 Difference]: Without dead ends: 56 [2024-11-02 12:39:22,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:39:22,445 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 16 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:39:22,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 101 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:39:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-02 12:39:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2024-11-02 12:39:22,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:39:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2024-11-02 12:39:22,458 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 8 [2024-11-02 12:39:22,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:39:22,458 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2024-11-02 12:39:22,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:39:22,459 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2024-11-02 12:39:22,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-02 12:39:22,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:39:22,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:39:22,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 12:39:22,460 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-02 12:39:22,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:39:22,462 INFO L85 PathProgramCache]: Analyzing trace with hash -2113677551, now seen corresponding path program 1 times [2024-11-02 12:39:22,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:39:22,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329780833] [2024-11-02 12:39:22,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:39:22,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:39:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:39:22,690 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-02 12:39:22,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:39:22,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329780833] [2024-11-02 12:39:22,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329780833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:39:22,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:39:22,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:39:22,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979081950] [2024-11-02 12:39:22,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:39:22,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:39:22,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:39:22,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:39:22,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:39:22,693 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:39:22,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:39:22,840 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2024-11-02 12:39:22,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 12:39:22,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-11-02 12:39:22,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:39:22,842 INFO L225 Difference]: With dead ends: 55 [2024-11-02 12:39:22,842 INFO L226 Difference]: Without dead ends: 55 [2024-11-02 12:39:22,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:39:22,843 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:39:22,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 126 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:39:22,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-02 12:39:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2024-11-02 12:39:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:39:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2024-11-02 12:39:22,849 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 8 [2024-11-02 12:39:22,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:39:22,849 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2024-11-02 12:39:22,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:39:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2024-11-02 12:39:22,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-02 12:39:22,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:39:22,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:39:22,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-02 12:39:22,851 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-02 12:39:22,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:39:22,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1151762607, now seen corresponding path program 1 times [2024-11-02 12:39:22,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:39:22,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909404756] [2024-11-02 12:39:22,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:39:22,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:39:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:39:22,927 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-02 12:39:22,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:39:22,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909404756] [2024-11-02 12:39:22,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909404756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:39:22,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:39:22,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 12:39:22,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370175148] [2024-11-02 12:39:22,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:39:22,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 12:39:22,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:39:22,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 12:39:22,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:39:22,930 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:39:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:39:23,069 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2024-11-02 12:39:23,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 12:39:23,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-02 12:39:23,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:39:23,071 INFO L225 Difference]: With dead ends: 68 [2024-11-02 12:39:23,071 INFO L226 Difference]: Without dead ends: 68 [2024-11-02 12:39:23,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:39:23,072 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 19 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:39:23,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 104 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:39:23,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-02 12:39:23,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2024-11-02 12:39:23,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.868421052631579) internal successors, (71), 57 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:39:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2024-11-02 12:39:23,082 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 13 [2024-11-02 12:39:23,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:39:23,089 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2024-11-02 12:39:23,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:39:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2024-11-02 12:39:23,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-02 12:39:23,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:39:23,090 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:39:23,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-02 12:39:23,090 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-02 12:39:23,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:39:23,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1151762608, now seen corresponding path program 1 times [2024-11-02 12:39:23,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:39:23,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485506854] [2024-11-02 12:39:23,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:39:23,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:39:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:39:23,367 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-02 12:39:23,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:39:23,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485506854] [2024-11-02 12:39:23,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485506854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:39:23,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:39:23,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-02 12:39:23,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615262139] [2024-11-02 12:39:23,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:39:23,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-02 12:39:23,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:39:23,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-02 12:39:23,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-02 12:39:23,369 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:39:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:39:23,534 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2024-11-02 12:39:23,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 12:39:23,535 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-02 12:39:23,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:39:23,536 INFO L225 Difference]: With dead ends: 68 [2024-11-02 12:39:23,536 INFO L226 Difference]: Without dead ends: 68 [2024-11-02 12:39:23,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-02 12:39:23,537 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:39:23,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 218 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:39:23,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-02 12:39:23,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-11-02 12:39:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.8095238095238095) internal successors, (76), 61 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:39:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2024-11-02 12:39:23,550 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 13 [2024-11-02 12:39:23,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:39:23,550 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2024-11-02 12:39:23,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:39:23,551 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2024-11-02 12:39:23,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-02 12:39:23,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:39:23,551 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:39:23,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-02 12:39:23,552 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-02 12:39:23,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:39:23,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1344974105, now seen corresponding path program 1 times [2024-11-02 12:39:23,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:39:23,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235624121] [2024-11-02 12:39:23,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:39:23,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:39:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:39:23,649 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-02 12:39:23,649 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:39:23,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235624121] [2024-11-02 12:39:23,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235624121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:39:23,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:39:23,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-02 12:39:23,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414458514] [2024-11-02 12:39:23,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:39:23,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-02 12:39:23,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:39:23,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-02 12:39:23,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-02 12:39:23,652 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:39:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:39:23,733 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2024-11-02 12:39:23,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 12:39:23,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-02 12:39:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:39:23,738 INFO L225 Difference]: With dead ends: 69 [2024-11-02 12:39:23,738 INFO L226 Difference]: Without dead ends: 69 [2024-11-02 12:39:23,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-02 12:39:23,739 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:39:23,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 223 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:39:23,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-02 12:39:23,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2024-11-02 12:39:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.744186046511628) internal successors, (75), 62 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:39:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2024-11-02 12:39:23,753 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 14 [2024-11-02 12:39:23,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:39:23,753 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-11-02 12:39:23,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:39:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2024-11-02 12:39:23,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-02 12:39:23,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:39:23,754 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:39:23,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-02 12:39:23,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-02 12:39:23,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:39:23,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1212264992, now seen corresponding path program 1 times [2024-11-02 12:39:23,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:39:23,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463195208] [2024-11-02 12:39:23,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:39:23,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:39:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:39:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:39:23,915 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:39:23,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463195208] [2024-11-02 12:39:23,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463195208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:39:23,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:39:23,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:39:23,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558199205] [2024-11-02 12:39:23,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:39:23,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:39:23,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:39:23,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:39:23,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:39:23,924 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:39:24,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:39:24,095 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2024-11-02 12:39:24,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 12:39:24,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-02 12:39:24,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:39:24,096 INFO L225 Difference]: With dead ends: 67 [2024-11-02 12:39:24,096 INFO L226 Difference]: Without dead ends: 67 [2024-11-02 12:39:24,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-02 12:39:24,097 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:39:24,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 115 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:39:24,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-02 12:39:24,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-02 12:39:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 62 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:39:24,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2024-11-02 12:39:24,101 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 15 [2024-11-02 12:39:24,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:39:24,102 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2024-11-02 12:39:24,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:39:24,102 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2024-11-02 12:39:24,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-02 12:39:24,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:39:24,103 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:39:24,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-02 12:39:24,103 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-02 12:39:24,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:39:24,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1212264991, now seen corresponding path program 1 times [2024-11-02 12:39:24,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:39:24,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300915089] [2024-11-02 12:39:24,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:39:24,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:39:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:39:24,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:39:24,520 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:39:24,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300915089] [2024-11-02 12:39:24,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300915089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:39:24,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002876637] [2024-11-02 12:39:24,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:39:24,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:39:24,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:39:24,526 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:39:24,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-02 12:39:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:39:24,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-02 12:39:24,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:39:24,887 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-02 12:39:24,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 12:39:24,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-02 12:39:24,962 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-02 12:39:24,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-02 12:39:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-02 12:39:24,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 12:39:25,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002876637] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:39:25,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [883974782] [2024-11-02 12:39:25,197 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2024-11-02 12:39:25,197 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 12:39:25,202 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 12:39:25,207 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 12:39:25,207 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 12:39:25,994 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 127 for LOIs [2024-11-02 12:39:26,124 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-02 12:39:38,038 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1396#(and (exists ((|v_ULTIMATE.start_create_~now~0#1.base_27| Int)) (and (or (and (not (= |ULTIMATE.start_create_~data~0#1.base| 0)) (<= (+ |ULTIMATE.start_create_~data~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_39| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_39| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_int_39| |ULTIMATE.start_create_#t~ret8#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_create_#t~ret8#1.base|) 0))))) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (<= (+ |ULTIMATE.start_create_#t~ret8#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_57| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_57| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.base_57| |ULTIMATE.start_create_#t~ret8#1.base|) 0 0)))) (exists ((|v_#length_61| (Array Int Int))) (<= 16 (select (store (store |v_#length_61| |ULTIMATE.start_create_~sll~0#1.base| 16) |ULTIMATE.start_create_~data~0#1.base| 4) |v_ULTIMATE.start_create_~now~0#1.base_27|))) (exists ((|v_#valid_71| (Array Int Int))) (and (= (select |v_#valid_71| |ULTIMATE.start_create_~data~0#1.base|) 0) (= 0 (select |v_#valid_71| |ULTIMATE.start_create_~sll~0#1.base|)))) (exists ((|v_#valid_74| (Array Int Int))) (and (= (store |v_#valid_74| |ULTIMATE.start_create_#t~ret8#1.base| 1) |#valid|) (= (select |v_#valid_74| |ULTIMATE.start_create_#t~ret8#1.base|) 0))) (not (= |ULTIMATE.start_create_#t~ret8#1.base| 0)) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_41| (Array Int (Array Int Int))) (|v_#memory_int_43| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_6| (Array Int (Array Int Int)))) (and (<= 0 (+ (select (select |v_#memory_int_41| |ULTIMATE.start_create_~data~0#1.base|) 0) 2147483648)) (= (store |v_#memory_int_43| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_43| |ULTIMATE.start_create_~sll~0#1.base|) 0 (select (select |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base|) 0))) |v_#memory_int_40|) (= (store |v_#memory_int_40| |ULTIMATE.start_create_~data~0#1.base| (store (select |v_#memory_int_40| |ULTIMATE.start_create_~data~0#1.base|) 0 (select (select |v_#memory_int_41| |ULTIMATE.start_create_~data~0#1.base|) 0))) |v_#memory_int_41|) (= |v_old(#memory_int)_AFTER_CALL_6| (store |v_#memory_int_41| |v_ULTIMATE.start_create_~now~0#1.base_27| (store (select |v_#memory_int_41| |v_ULTIMATE.start_create_~now~0#1.base_27|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_6| |v_ULTIMATE.start_create_~now~0#1.base_27|) 8)))) (<= (select (select |v_#memory_int_41| |ULTIMATE.start_create_~data~0#1.base|) 0) 2147483647))) (exists ((|v_#memory_$Pointer$.offset_57| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_57| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.offset_57| |ULTIMATE.start_create_#t~ret8#1.base|) 0 0)))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_55| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.offset_53| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_53| |ULTIMATE.start_create_~sll~0#1.base|) 0 0)) |ULTIMATE.start_create_~data~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_53| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_53| |ULTIMATE.start_create_~sll~0#1.base|) 0 0)) |ULTIMATE.start_create_~data~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_55| |ULTIMATE.start_create_~data~0#1.base|) 0))) |v_#memory_$Pointer$.offset_55|)) (exists ((|v_#length_58| (Array Int Int))) (= |#length| (store |v_#length_58| |ULTIMATE.start_create_#t~ret8#1.base| 16))) (exists ((|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_55| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_53| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_53| |ULTIMATE.start_create_~sll~0#1.base|) 0 0)) |ULTIMATE.start_create_~data~0#1.base| (store (select (store |v_#memory_$Pointer$.base_53| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_53| |ULTIMATE.start_create_~sll~0#1.base|) 0 0)) |ULTIMATE.start_create_~data~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_55| |ULTIMATE.start_create_~data~0#1.base|) 0))) |v_#memory_$Pointer$.base_55|)) (exists ((|v_ULTIMATE.start_create_#t~nondet7#1_12| Int)) (and (<= |v_ULTIMATE.start_create_#t~nondet7#1_12| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet7#1_12| 2147483648)) (not (= |v_ULTIMATE.start_create_#t~nondet7#1_12| 0)))) (= |ULTIMATE.start_create_~sll~0#1.base| |v_ULTIMATE.start_create_~now~0#1.base_27|)) (and (not (= |ULTIMATE.start_create_~data~0#1.base| 0)) (<= (+ |ULTIMATE.start_create_~data~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_39| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_39| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_int_39| |ULTIMATE.start_create_#t~ret8#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_create_#t~ret8#1.base|) 0))))) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (<= (+ |ULTIMATE.start_create_#t~ret8#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_41| (Array Int (Array Int Int))) (|v_#memory_int_42| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_5| (Array Int (Array Int Int)))) (and (<= 0 (+ (select (select |v_#memory_int_41| |ULTIMATE.start_create_~data~0#1.base|) 0) 2147483648)) (= (store |v_#memory_int_41| |v_ULTIMATE.start_create_~now~0#1.base_27| (store (select |v_#memory_int_41| |v_ULTIMATE.start_create_~now~0#1.base_27|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_5| |v_ULTIMATE.start_create_~now~0#1.base_27|) 8))) |v_old(#memory_int)_AFTER_CALL_5|) (= (store |v_#memory_int_42| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_42| |ULTIMATE.start_create_~sll~0#1.base|) 0 (select (select |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base|) 0))) |v_#memory_int_40|) (= (store |v_#memory_int_40| |ULTIMATE.start_create_~data~0#1.base| (store (select |v_#memory_int_40| |ULTIMATE.start_create_~data~0#1.base|) 0 (select (select |v_#memory_int_41| |ULTIMATE.start_create_~data~0#1.base|) 0))) |v_#memory_int_41|) (<= (select (select |v_#memory_int_41| |ULTIMATE.start_create_~data~0#1.base|) 0) 2147483647))) (exists ((|v_#valid_71| (Array Int Int))) (and (= (select |v_#valid_71| |ULTIMATE.start_create_~data~0#1.base|) 0) (= 0 (select |v_#valid_71| |ULTIMATE.start_create_~sll~0#1.base|)))) (exists ((|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_53| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.offset_53| |ULTIMATE.start_create_#t~ret8#1.base|) 0 0)))) (not (= |ULTIMATE.start_create_#t~ret8#1.base| 0)) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_58| (Array Int Int))) (<= 16 (select (store (store |v_#length_58| |ULTIMATE.start_create_~sll~0#1.base| 16) |ULTIMATE.start_create_~data~0#1.base| 4) |v_ULTIMATE.start_create_~now~0#1.base_27|))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#length_60| (Array Int Int))) (= |#length| (store |v_#length_60| |ULTIMATE.start_create_#t~ret8#1.base| 16))) (exists ((|v_#valid_73| (Array Int Int))) (and (= (select |v_#valid_73| |ULTIMATE.start_create_#t~ret8#1.base|) 0) (= (store |v_#valid_73| |ULTIMATE.start_create_#t~ret8#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_55| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_53| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_53| |ULTIMATE.start_create_~sll~0#1.base|) 0 0)) |ULTIMATE.start_create_~data~0#1.base| (store (select (store |v_#memory_$Pointer$.base_53| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_53| |ULTIMATE.start_create_~sll~0#1.base|) 0 0)) |ULTIMATE.start_create_~data~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_55| |ULTIMATE.start_create_~data~0#1.base|) 0))) |v_#memory_$Pointer$.base_55|)) (exists ((|v_ULTIMATE.start_create_#t~nondet7#1_12| Int)) (and (<= |v_ULTIMATE.start_create_#t~nondet7#1_12| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet7#1_12| 2147483648)) (not (= |v_ULTIMATE.start_create_#t~nondet7#1_12| 0)))) (exists ((|v_#memory_$Pointer$.base_56| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_56| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.base_56| |ULTIMATE.start_create_#t~ret8#1.base|) 0 0)) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_create_~sll~0#1.base| |v_ULTIMATE.start_create_~now~0#1.base_27|) (exists ((|v_#memory_$Pointer$.offset_55| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_56| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.offset_56| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_56| |ULTIMATE.start_create_~sll~0#1.base|) 0 0)) |ULTIMATE.start_create_~data~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_56| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_56| |ULTIMATE.start_create_~sll~0#1.base|) 0 0)) |ULTIMATE.start_create_~data~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_55| |ULTIMATE.start_create_~data~0#1.base|) 0))) |v_#memory_$Pointer$.offset_55|)))) (<= (select |#length| |v_ULTIMATE.start_create_~now~0#1.base_27|) 7))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_create_~sll~0#1.offset| 0) (= |ULTIMATE.start_create_~data~0#1.offset| 0) (= |ULTIMATE.start_create_#t~ret8#1.offset| 0))' at error location [2024-11-02 12:39:38,039 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-02 12:39:38,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 12:39:38,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-11-02 12:39:38,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986193413] [2024-11-02 12:39:38,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 12:39:38,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-02 12:39:38,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:39:38,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-02 12:39:38,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=748, Unknown=2, NotChecked=56, Total=930 [2024-11-02 12:39:38,041 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 18 states, 14 states have (on average 1.5) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-02 12:39:38,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:39:38,455 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2024-11-02 12:39:38,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-02 12:39:38,455 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 1.5) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 15 [2024-11-02 12:39:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:39:38,456 INFO L225 Difference]: With dead ends: 69 [2024-11-02 12:39:38,456 INFO L226 Difference]: Without dead ends: 69 [2024-11-02 12:39:38,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=150, Invalid=908, Unknown=2, NotChecked=62, Total=1122 [2024-11-02 12:39:38,458 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 28 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 12:39:38,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 247 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 237 Invalid, 0 Unknown, 64 Unchecked, 0.3s Time] [2024-11-02 12:39:38,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-02 12:39:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2024-11-02 12:39:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 62 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:39:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2024-11-02 12:39:38,463 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 15 [2024-11-02 12:39:38,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:39:38,463 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2024-11-02 12:39:38,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 1.5) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-02 12:39:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2024-11-02 12:39:38,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-02 12:39:38,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:39:38,465 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:39:38,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-02 12:39:38,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-02 12:39:38,670 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-02 12:39:38,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:39:38,673 INFO L85 PathProgramCache]: Analyzing trace with hash -331815379, now seen corresponding path program 1 times [2024-11-02 12:39:38,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:39:38,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844134521] [2024-11-02 12:39:38,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:39:38,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:39:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:39:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:39:39,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:39:39,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844134521] [2024-11-02 12:39:39,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844134521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:39:39,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002306669] [2024-11-02 12:39:39,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:39:39,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:39:39,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:39:39,230 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:39:39,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-02 12:39:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:39:39,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-02 12:39:39,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:39:39,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-02 12:39:39,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-02 12:39:39,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-02 12:39:39,470 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-02 12:39:39,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-02 12:39:39,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-02 12:39:39,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-02 12:39:39,613 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-02 12:39:39,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2024-11-02 12:39:39,634 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-02 12:39:39,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2024-11-02 12:39:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:39:39,823 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 12:39:40,299 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_loop_~x#1.offset_27| Int) (v_ArrVal_265 (Array Int Int)) (|ULTIMATE.start_create_~data~0#1.offset| Int)) (or (< |v_ULTIMATE.start_loop_~x#1.offset_27| 0) (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_265))) (store .cse0 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 |ULTIMATE.start_create_~data~0#1.offset|))) |c_ULTIMATE.start_create_~sll~0#1.base|) |v_ULTIMATE.start_loop_~x#1.offset_27|)) (< |c_ULTIMATE.start_create_~sll~0#1.offset| |v_ULTIMATE.start_loop_~x#1.offset_27|))) (forall ((v_ArrVal_266 Int) (|v_ULTIMATE.start_loop_~x#1.offset_27| Int) (v_ArrVal_264 (Array Int Int))) (or (< |v_ULTIMATE.start_loop_~x#1.offset_27| 0) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_264))) (store .cse2 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 v_ArrVal_266))) |c_ULTIMATE.start_create_~sll~0#1.base|) |v_ULTIMATE.start_loop_~x#1.offset_27|) 0) (< |c_ULTIMATE.start_create_~sll~0#1.offset| |v_ULTIMATE.start_loop_~x#1.offset_27|))))) is different from false [2024-11-02 12:39:40,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 12:39:40,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 64 [2024-11-02 12:39:40,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 12:39:40,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 56 [2024-11-02 12:39:40,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 12:39:40,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2024-11-02 12:39:40,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-02 12:39:40,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 12:39:40,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 72 [2024-11-02 12:39:40,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2024-11-02 12:39:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:39:41,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002306669] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 12:39:41,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2071127639] [2024-11-02 12:39:41,181 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-02 12:39:41,181 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 12:39:41,182 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 12:39:41,182 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 12:39:41,182 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 12:39:41,728 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2024-11-02 12:39:41,739 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-02 12:39:46,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [2071127639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:39:46,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-02 12:39:46,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10, 10, 10] total 35 [2024-11-02 12:39:46,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827163423] [2024-11-02 12:39:46,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:39:46,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-02 12:39:46,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:39:46,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-02 12:39:46,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=988, Unknown=1, NotChecked=64, Total=1190 [2024-11-02 12:39:46,747 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 13 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:39:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:39:49,038 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2024-11-02 12:39:49,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-02 12:39:49,040 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-02 12:39:49,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:39:49,041 INFO L225 Difference]: With dead ends: 73 [2024-11-02 12:39:49,041 INFO L226 Difference]: Without dead ends: 73 [2024-11-02 12:39:49,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=137, Invalid=988, Unknown=1, NotChecked=64, Total=1190 [2024-11-02 12:39:49,047 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-02 12:39:49,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2024-11-02 12:39:49,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-02 12:39:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-11-02 12:39:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 65 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:39:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2024-11-02 12:39:49,058 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 16 [2024-11-02 12:39:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:39:49,058 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2024-11-02 12:39:49,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:39:49,059 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2024-11-02 12:39:49,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-02 12:39:49,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:39:49,069 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:39:49,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-02 12:39:49,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-02 12:39:49,273 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-02 12:39:49,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:39:49,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1050422936, now seen corresponding path program 1 times [2024-11-02 12:39:49,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:39:49,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702274298] [2024-11-02 12:39:49,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:39:49,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:39:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:39:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-02 12:39:49,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:39:49,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702274298] [2024-11-02 12:39:49,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702274298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:39:49,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:39:49,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:39:49,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177459744] [2024-11-02 12:39:49,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:39:49,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:39:49,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:39:49,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:39:49,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:39:49,427 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 12:39:49,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:39:49,607 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2024-11-02 12:39:49,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 12:39:49,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-11-02 12:39:49,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:39:49,610 INFO L225 Difference]: With dead ends: 70 [2024-11-02 12:39:49,610 INFO L226 Difference]: Without dead ends: 70 [2024-11-02 12:39:49,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-02 12:39:49,612 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:39:49,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 126 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:39:49,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-02 12:39:49,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-02 12:39:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 64 states have internal predecessors, (73), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:39:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2024-11-02 12:39:49,622 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 17 [2024-11-02 12:39:49,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:39:49,622 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-11-02 12:39:49,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 12:39:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2024-11-02 12:39:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-02 12:39:49,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:39:49,623 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:39:49,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-02 12:39:49,623 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-02 12:39:49,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:39:49,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1050422935, now seen corresponding path program 1 times [2024-11-02 12:39:49,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:39:49,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769615633] [2024-11-02 12:39:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:39:49,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:39:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:39:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-02 12:39:49,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:39:49,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769615633] [2024-11-02 12:39:49,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769615633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:39:49,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:39:49,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-02 12:39:49,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491812904] [2024-11-02 12:39:49,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:39:49,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-02 12:39:49,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:39:49,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-02 12:39:49,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-02 12:39:49,922 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 12:39:50,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:39:50,123 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2024-11-02 12:39:50,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 12:39:50,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-11-02 12:39:50,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:39:50,124 INFO L225 Difference]: With dead ends: 69 [2024-11-02 12:39:50,125 INFO L226 Difference]: Without dead ends: 69 [2024-11-02 12:39:50,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-02 12:39:50,126 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:39:50,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 165 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:39:50,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-02 12:39:50,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-02 12:39:50,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 63 states have internal predecessors, (71), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:39:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2024-11-02 12:39:50,135 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 17 [2024-11-02 12:39:50,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:39:50,135 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2024-11-02 12:39:50,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-02 12:39:50,135 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2024-11-02 12:39:50,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-02 12:39:50,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:39:50,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:39:50,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-02 12:39:50,136 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-02 12:39:50,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:39:50,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1696270501, now seen corresponding path program 1 times [2024-11-02 12:39:50,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:39:50,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610336907] [2024-11-02 12:39:50,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:39:50,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:39:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:39:50,218 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-02 12:39:50,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:39:50,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610336907] [2024-11-02 12:39:50,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610336907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:39:50,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646233158] [2024-11-02 12:39:50,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:39:50,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:39:50,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:39:50,222 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:39:50,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10665b37-cd48-4dd8-b914-0bb24a6edc1c/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-02 12:39:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:39:50,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-02 12:39:50,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:39:50,334 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-02 12:39:50,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 12:39:50,355 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-02 12:39:50,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2024-11-02 12:39:50,366 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-02 12:39:50,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646233158] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 12:39:50,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1120113509] [2024-11-02 12:39:50,369 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-02 12:39:50,369 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 12:39:50,369 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 12:39:50,369 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 12:39:50,370 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 12:39:50,877 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2024-11-02 12:39:50,888 INFO L180 IcfgInterpreter]: Interpretation finished