./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/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_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/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 32bit --witnessprinter.graph.data.programhash 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 11:20:53,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 11:20:54,059 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-02 11:20:54,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 11:20:54,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 11:20:54,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 11:20:54,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 11:20:54,103 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 11:20:54,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 11:20:54,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 11:20:54,108 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 11:20:54,108 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 11:20:54,109 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 11:20:54,109 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-02 11:20:54,110 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 11:20:54,110 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 11:20:54,113 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-02 11:20:54,113 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-02 11:20:54,114 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 11:20:54,114 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-02 11:20:54,115 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-02 11:20:54,118 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-02 11:20:54,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 11:20:54,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 11:20:54,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 11:20:54,120 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 11:20:54,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 11:20:54,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 11:20:54,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 11:20:54,123 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-02 11:20:54,123 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-02 11:20:54,124 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-02 11:20:54,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 11:20:54,125 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 11:20:54,126 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 11:20:54,126 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-02 11:20:54,126 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 11:20:54,127 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 11:20:54,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 11:20:54,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 11:20:54,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 11:20:54,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 11:20:54,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 11:20:54,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 11:20:54,129 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-02 11:20:54,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-02 11:20:54,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 11:20:54,130 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 11:20:54,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 11:20:54,131 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_a793bf7b-d752-493d-9e8a-2886c84af89b/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_a793bf7b-d752-493d-9e8a-2886c84af89b/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2024-11-02 11:20:54,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 11:20:54,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 11:20:54,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 11:20:54,452 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 11:20:54,453 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 11:20:54,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i Unable to find full path for "g++" [2024-11-02 11:20:56,499 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 11:20:56,865 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 11:20:56,866 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2024-11-02 11:20:56,880 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/data/42fc7d13b/071b1d45b3b445f18ab43b5ef2b92416/FLAGffa9ea803 [2024-11-02 11:20:56,896 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/data/42fc7d13b/071b1d45b3b445f18ab43b5ef2b92416 [2024-11-02 11:20:56,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 11:20:56,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 11:20:56,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 11:20:56,902 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 11:20:56,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 11:20:56,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:20:56" (1/1) ... [2024-11-02 11:20:56,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f7f105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:20:56, skipping insertion in model container [2024-11-02 11:20:56,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:20:56" (1/1) ... [2024-11-02 11:20:56,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 11:20:57,309 WARN L1053 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-02 11:20:57,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 11:20:57,360 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 11:20:57,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 11:20:57,485 INFO L204 MainTranslator]: Completed translation [2024-11-02 11:20:57,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:20:57 WrapperNode [2024-11-02 11:20:57,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 11:20:57,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 11:20:57,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 11:20:57,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 11:20:57,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:20:57" (1/1) ... [2024-11-02 11:20:57,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:20:57" (1/1) ... [2024-11-02 11:20:57,548 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2024-11-02 11:20:57,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 11:20:57,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 11:20:57,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 11:20:57,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 11:20:57,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:20:57" (1/1) ... [2024-11-02 11:20:57,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:20:57" (1/1) ... [2024-11-02 11:20:57,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:20:57" (1/1) ... [2024-11-02 11:20:57,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:20:57" (1/1) ... [2024-11-02 11:20:57,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:20:57" (1/1) ... [2024-11-02 11:20:57,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:20:57" (1/1) ... [2024-11-02 11:20:57,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:20:57" (1/1) ... [2024-11-02 11:20:57,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:20:57" (1/1) ... [2024-11-02 11:20:57,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 11:20:57,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 11:20:57,622 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 11:20:57,622 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 11:20:57,623 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:20:57" (1/1) ... [2024-11-02 11:20:57,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 11:20:57,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:20:57,659 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-02 11:20:57,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-02 11:20:57,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-02 11:20:57,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-02 11:20:57,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-02 11:20:57,698 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2024-11-02 11:20:57,698 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2024-11-02 11:20:57,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 11:20:57,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-02 11:20:57,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-02 11:20:57,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-02 11:20:57,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-02 11:20:57,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-02 11:20:57,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-02 11:20:57,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 11:20:57,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 11:20:57,858 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 11:20:57,861 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 11:20:58,669 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2024-11-02 11:20:58,669 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 11:20:58,778 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 11:20:58,778 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-02 11:20:58,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:20:58 BoogieIcfgContainer [2024-11-02 11:20:58,779 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 11:20:58,784 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 11:20:58,784 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 11:20:58,787 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 11:20:58,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 11:20:56" (1/3) ... [2024-11-02 11:20:58,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e20e988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:20:58, skipping insertion in model container [2024-11-02 11:20:58,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:20:57" (2/3) ... [2024-11-02 11:20:58,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e20e988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:20:58, skipping insertion in model container [2024-11-02 11:20:58,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:20:58" (3/3) ... [2024-11-02 11:20:58,792 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2024-11-02 11:20:58,811 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 11:20:58,811 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2024-11-02 11:20:58,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 11:20:58,885 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;@29d4a1f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 11:20:58,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-11-02 11:20:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 72 states have (on average 2.4722222222222223) internal successors, (178), 164 states have internal predecessors, (178), 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 11:20:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-02 11:20:58,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:20:58,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-02 11:20:58,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-02 11:20:58,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:20:58,915 INFO L85 PathProgramCache]: Analyzing trace with hash 328757, now seen corresponding path program 1 times [2024-11-02 11:20:58,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:20:58,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407809476] [2024-11-02 11:20:58,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:20:58,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:20:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:20:59,118 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 11:20:59,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:20:59,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407809476] [2024-11-02 11:20:59,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407809476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:20:59,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:20:59,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 11:20:59,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506156098] [2024-11-02 11:20:59,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:20:59,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-02 11:20:59,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:20:59,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-02 11:20:59,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-02 11:20:59,178 INFO L87 Difference]: Start difference. First operand has 168 states, 72 states have (on average 2.4722222222222223) internal successors, (178), 164 states have internal predecessors, (178), 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 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:20:59,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:20:59,267 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2024-11-02 11:20:59,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-02 11:20:59,270 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-02 11:20:59,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:20:59,278 INFO L225 Difference]: With dead ends: 168 [2024-11-02 11:20:59,279 INFO L226 Difference]: Without dead ends: 167 [2024-11-02 11:20:59,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-02 11:20:59,284 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:20:59,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:20:59,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-02 11:20:59,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-02 11:20:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 72 states have (on average 2.4166666666666665) internal successors, (174), 163 states have internal predecessors, (174), 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 11:20:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 178 transitions. [2024-11-02 11:20:59,343 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 178 transitions. Word has length 3 [2024-11-02 11:20:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:20:59,344 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 178 transitions. [2024-11-02 11:20:59,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:20:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 178 transitions. [2024-11-02 11:20:59,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-02 11:20:59,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:20:59,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-02 11:20:59,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 11:20:59,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-02 11:20:59,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:20:59,349 INFO L85 PathProgramCache]: Analyzing trace with hash 326321, now seen corresponding path program 1 times [2024-11-02 11:20:59,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:20:59,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255818820] [2024-11-02 11:20:59,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:20:59,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:20:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:20:59,579 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 11:20:59,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:20:59,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255818820] [2024-11-02 11:20:59,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255818820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:20:59,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:20:59,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 11:20:59,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164772294] [2024-11-02 11:20:59,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:20:59,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 11:20:59,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:20:59,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 11:20:59,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 11:20:59,585 INFO L87 Difference]: Start difference. First operand 167 states and 178 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:20:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:20:59,929 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2024-11-02 11:20:59,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 11:20:59,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-02 11:20:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:20:59,932 INFO L225 Difference]: With dead ends: 161 [2024-11-02 11:20:59,932 INFO L226 Difference]: Without dead ends: 161 [2024-11-02 11:20:59,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-02 11:20:59,934 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 67 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 11:20:59,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 226 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 11:20:59,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-02 11:20:59,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-02 11:20:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 72 states have (on average 2.3333333333333335) internal successors, (168), 157 states have internal predecessors, (168), 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 11:20:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 172 transitions. [2024-11-02 11:20:59,946 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 172 transitions. Word has length 3 [2024-11-02 11:20:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:20:59,947 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 172 transitions. [2024-11-02 11:20:59,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:20:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 172 transitions. [2024-11-02 11:20:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-02 11:20:59,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:20:59,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-02 11:20:59,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 11:20:59,948 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-02 11:20:59,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:20:59,949 INFO L85 PathProgramCache]: Analyzing trace with hash 326322, now seen corresponding path program 1 times [2024-11-02 11:20:59,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:20:59,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032282122] [2024-11-02 11:20:59,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:20:59,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:20:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:21:00,205 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 11:21:00,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:21:00,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032282122] [2024-11-02 11:21:00,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032282122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:21:00,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:21:00,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 11:21:00,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380513093] [2024-11-02 11:21:00,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:21:00,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 11:21:00,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:21:00,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 11:21:00,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 11:21:00,209 INFO L87 Difference]: Start difference. First operand 161 states and 172 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:21:00,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:21:00,639 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2024-11-02 11:21:00,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 11:21:00,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-02 11:21:00,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:21:00,643 INFO L225 Difference]: With dead ends: 176 [2024-11-02 11:21:00,643 INFO L226 Difference]: Without dead ends: 176 [2024-11-02 11:21:00,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-02 11:21:00,648 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 26 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-02 11:21:00,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 251 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-02 11:21:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-02 11:21:00,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2024-11-02 11:21:00,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 76 states have (on average 2.289473684210526) internal successors, (174), 161 states have internal predecessors, (174), 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 11:21:00,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2024-11-02 11:21:00,668 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 3 [2024-11-02 11:21:00,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:21:00,668 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2024-11-02 11:21:00,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:21:00,669 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2024-11-02 11:21:00,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-02 11:21:00,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:21:00,669 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-02 11:21:00,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 11:21:00,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-02 11:21:00,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:21:00,670 INFO L85 PathProgramCache]: Analyzing trace with hash 10116062, now seen corresponding path program 1 times [2024-11-02 11:21:00,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:21:00,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077683783] [2024-11-02 11:21:00,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:21:00,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:21:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:21:00,720 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 11:21:00,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:21:00,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077683783] [2024-11-02 11:21:00,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077683783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:21:00,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:21:00,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 11:21:00,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609692867] [2024-11-02 11:21:00,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:21:00,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:21:00,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:21:00,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:21:00,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:21:00,723 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:21:00,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:21:00,894 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2024-11-02 11:21:00,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:21:00,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-02 11:21:00,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:21:00,896 INFO L225 Difference]: With dead ends: 163 [2024-11-02 11:21:00,896 INFO L226 Difference]: Without dead ends: 163 [2024-11-02 11:21:00,896 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 11:21:00,898 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 12 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:21:00,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 205 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:21:00,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-02 11:21:00,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-11-02 11:21:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 76 states have (on average 2.25) internal successors, (171), 159 states have internal predecessors, (171), 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 11:21:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 175 transitions. [2024-11-02 11:21:00,907 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 175 transitions. Word has length 4 [2024-11-02 11:21:00,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:21:00,908 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 175 transitions. [2024-11-02 11:21:00,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:21:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 175 transitions. [2024-11-02 11:21:00,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-02 11:21:00,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:21:00,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-02 11:21:00,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 11:21:00,910 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-02 11:21:00,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:21:00,910 INFO L85 PathProgramCache]: Analyzing trace with hash 10116063, now seen corresponding path program 1 times [2024-11-02 11:21:00,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:21:00,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187005856] [2024-11-02 11:21:00,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:21:00,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:21:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:21:00,999 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 11:21:01,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:21:01,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187005856] [2024-11-02 11:21:01,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187005856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:21:01,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:21:01,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 11:21:01,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398945850] [2024-11-02 11:21:01,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:21:01,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:21:01,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:21:01,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:21:01,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:21:01,004 INFO L87 Difference]: Start difference. First operand 163 states and 175 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:21:01,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:21:01,199 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2024-11-02 11:21:01,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:21:01,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-02 11:21:01,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:21:01,201 INFO L225 Difference]: With dead ends: 161 [2024-11-02 11:21:01,201 INFO L226 Difference]: Without dead ends: 161 [2024-11-02 11:21:01,201 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 11:21:01,202 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:21:01,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 208 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:21:01,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-02 11:21:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-02 11:21:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 76 states have (on average 2.210526315789474) internal successors, (168), 157 states have internal predecessors, (168), 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 11:21:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 172 transitions. [2024-11-02 11:21:01,221 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 172 transitions. Word has length 4 [2024-11-02 11:21:01,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:21:01,221 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 172 transitions. [2024-11-02 11:21:01,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:21:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 172 transitions. [2024-11-02 11:21:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-02 11:21:01,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:21:01,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:21:01,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 11:21:01,223 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-02 11:21:01,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:21:01,227 INFO L85 PathProgramCache]: Analyzing trace with hash 998682099, now seen corresponding path program 1 times [2024-11-02 11:21:01,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:21:01,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675041613] [2024-11-02 11:21:01,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:21:01,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:21:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:21:01,478 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 11:21:01,479 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:21:01,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675041613] [2024-11-02 11:21:01,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675041613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:21:01,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:21:01,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 11:21:01,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631502911] [2024-11-02 11:21:01,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:21:01,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 11:21:01,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:21:01,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 11:21:01,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 11:21:01,481 INFO L87 Difference]: Start difference. First operand 161 states and 172 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:21:01,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:21:01,824 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2024-11-02 11:21:01,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 11:21:01,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-02 11:21:01,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:21:01,826 INFO L225 Difference]: With dead ends: 163 [2024-11-02 11:21:01,826 INFO L226 Difference]: Without dead ends: 163 [2024-11-02 11:21:01,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-02 11:21:01,828 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 3 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 11:21:01,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 578 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 11:21:01,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-02 11:21:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2024-11-02 11:21:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 77 states have (on average 2.1948051948051948) internal successors, (169), 158 states have internal predecessors, (169), 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 11:21:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2024-11-02 11:21:01,836 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 8 [2024-11-02 11:21:01,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:21:01,836 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2024-11-02 11:21:01,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 11:21:01,836 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2024-11-02 11:21:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-02 11:21:01,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:21:01,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:21:01,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-02 11:21:01,838 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-02 11:21:01,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:21:01,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1952744820, now seen corresponding path program 1 times [2024-11-02 11:21:01,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:21:01,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342795676] [2024-11-02 11:21:01,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:21:01,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:21:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:21:01,916 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 11:21:01,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:21:01,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342795676] [2024-11-02 11:21:01,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342795676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:21:01,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:21:01,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 11:21:01,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84945629] [2024-11-02 11:21:01,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:21:01,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 11:21:01,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:21:01,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 11:21:01,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 11:21:01,919 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 11:21:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:21:02,047 INFO L93 Difference]: Finished difference Result 231 states and 246 transitions. [2024-11-02 11:21:02,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 11:21:02,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2024-11-02 11:21:02,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:21:02,049 INFO L225 Difference]: With dead ends: 231 [2024-11-02 11:21:02,049 INFO L226 Difference]: Without dead ends: 231 [2024-11-02 11:21:02,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-02 11:21:02,050 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 73 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:21:02,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 414 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:21:02,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-02 11:21:02,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 195. [2024-11-02 11:21:02,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 109 states have (on average 2.220183486238532) internal successors, (242), 190 states have internal predecessors, (242), 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 11:21:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 246 transitions. [2024-11-02 11:21:02,059 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 246 transitions. Word has length 10 [2024-11-02 11:21:02,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:21:02,060 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 246 transitions. [2024-11-02 11:21:02,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 11:21:02,060 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 246 transitions. [2024-11-02 11:21:02,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-02 11:21:02,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:21:02,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:21:02,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-02 11:21:02,061 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-02 11:21:02,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:21:02,062 INFO L85 PathProgramCache]: Analyzing trace with hash 405553465, now seen corresponding path program 1 times [2024-11-02 11:21:02,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:21:02,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626103127] [2024-11-02 11:21:02,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:21:02,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:21:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:21:02,146 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 11:21:02,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:21:02,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626103127] [2024-11-02 11:21:02,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626103127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:21:02,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:21:02,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 11:21:02,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286039551] [2024-11-02 11:21:02,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:21:02,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:21:02,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:21:02,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:21:02,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:21:02,148 INFO L87 Difference]: Start difference. First operand 195 states and 246 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 11:21:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:21:02,318 INFO L93 Difference]: Finished difference Result 180 states and 216 transitions. [2024-11-02 11:21:02,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:21:02,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2024-11-02 11:21:02,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:21:02,320 INFO L225 Difference]: With dead ends: 180 [2024-11-02 11:21:02,320 INFO L226 Difference]: Without dead ends: 180 [2024-11-02 11:21:02,321 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 11:21:02,321 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 36 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:21:02,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 150 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:21:02,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-02 11:21:02,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-11-02 11:21:02,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 109 states have (on average 1.944954128440367) internal successors, (212), 175 states have internal predecessors, (212), 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 11:21:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2024-11-02 11:21:02,328 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 11 [2024-11-02 11:21:02,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:21:02,329 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2024-11-02 11:21:02,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 11:21:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2024-11-02 11:21:02,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-02 11:21:02,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:21:02,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:21:02,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-02 11:21:02,330 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-02 11:21:02,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:21:02,331 INFO L85 PathProgramCache]: Analyzing trace with hash 405553466, now seen corresponding path program 1 times [2024-11-02 11:21:02,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:21:02,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115304130] [2024-11-02 11:21:02,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:21:02,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:21:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:21:02,441 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 11:21:02,441 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:21:02,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115304130] [2024-11-02 11:21:02,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115304130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:21:02,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:21:02,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 11:21:02,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250147574] [2024-11-02 11:21:02,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:21:02,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:21:02,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:21:02,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:21:02,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:21:02,449 INFO L87 Difference]: Start difference. First operand 180 states and 216 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 11:21:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:21:02,610 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2024-11-02 11:21:02,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:21:02,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2024-11-02 11:21:02,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:21:02,611 INFO L225 Difference]: With dead ends: 165 [2024-11-02 11:21:02,611 INFO L226 Difference]: Without dead ends: 165 [2024-11-02 11:21:02,612 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 11:21:02,612 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 36 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:21:02,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 151 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:21:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-02 11:21:02,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-02 11:21:02,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 109 states have (on average 1.6697247706422018) internal successors, (182), 160 states have internal predecessors, (182), 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 11:21:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 186 transitions. [2024-11-02 11:21:02,623 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 186 transitions. Word has length 11 [2024-11-02 11:21:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:21:02,624 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 186 transitions. [2024-11-02 11:21:02,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 11:21:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2024-11-02 11:21:02,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-02 11:21:02,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:21:02,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:21:02,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-02 11:21:02,625 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-02 11:21:02,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:21:02,626 INFO L85 PathProgramCache]: Analyzing trace with hash 108174754, now seen corresponding path program 1 times [2024-11-02 11:21:02,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:21:02,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786267318] [2024-11-02 11:21:02,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:21:02,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:21:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:21:02,773 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 11:21:02,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:21:02,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786267318] [2024-11-02 11:21:02,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786267318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:21:02,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:21:02,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 11:21:02,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583185613] [2024-11-02 11:21:02,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:21:02,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 11:21:02,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:21:02,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 11:21:02,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 11:21:02,776 INFO L87 Difference]: Start difference. First operand 165 states and 186 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 11:21:03,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:21:03,090 INFO L93 Difference]: Finished difference Result 206 states and 240 transitions. [2024-11-02 11:21:03,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 11:21:03,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 14 [2024-11-02 11:21:03,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:21:03,092 INFO L225 Difference]: With dead ends: 206 [2024-11-02 11:21:03,092 INFO L226 Difference]: Without dead ends: 206 [2024-11-02 11:21:03,093 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 11:21:03,094 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 18 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 11:21:03,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 296 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 11:21:03,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-02 11:21:03,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 171. [2024-11-02 11:21:03,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 115 states have (on average 1.6695652173913043) internal successors, (192), 166 states have internal predecessors, (192), 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 11:21:03,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 196 transitions. [2024-11-02 11:21:03,100 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 196 transitions. Word has length 14 [2024-11-02 11:21:03,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:21:03,101 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 196 transitions. [2024-11-02 11:21:03,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 11:21:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 196 transitions. [2024-11-02 11:21:03,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-02 11:21:03,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:21:03,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:21:03,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-02 11:21:03,102 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-02 11:21:03,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:21:03,103 INFO L85 PathProgramCache]: Analyzing trace with hash 108174755, now seen corresponding path program 1 times [2024-11-02 11:21:03,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:21:03,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206618599] [2024-11-02 11:21:03,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:21:03,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:21:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:21:03,372 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 11:21:03,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:21:03,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206618599] [2024-11-02 11:21:03,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206618599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:21:03,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:21:03,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 11:21:03,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784664098] [2024-11-02 11:21:03,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:21:03,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 11:21:03,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:21:03,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 11:21:03,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 11:21:03,374 INFO L87 Difference]: Start difference. First operand 171 states and 196 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 11:21:03,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:21:03,731 INFO L93 Difference]: Finished difference Result 171 states and 192 transitions. [2024-11-02 11:21:03,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 11:21:03,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 14 [2024-11-02 11:21:03,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:21:03,734 INFO L225 Difference]: With dead ends: 171 [2024-11-02 11:21:03,734 INFO L226 Difference]: Without dead ends: 171 [2024-11-02 11:21:03,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-02 11:21:03,735 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 11:21:03,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 305 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 11:21:03,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-02 11:21:03,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-02 11:21:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 115 states have (on average 1.6347826086956523) internal successors, (188), 166 states have internal predecessors, (188), 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 11:21:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 192 transitions. [2024-11-02 11:21:03,748 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 192 transitions. Word has length 14 [2024-11-02 11:21:03,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:21:03,749 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 192 transitions. [2024-11-02 11:21:03,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 11:21:03,750 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 192 transitions. [2024-11-02 11:21:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-02 11:21:03,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:21:03,750 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:21:03,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-02 11:21:03,751 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-02 11:21:03,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:21:03,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1416169509, now seen corresponding path program 1 times [2024-11-02 11:21:03,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:21:03,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938097294] [2024-11-02 11:21:03,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:21:03,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:21:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:21:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:21:03,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:21:03,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938097294] [2024-11-02 11:21:03,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938097294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 11:21:03,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916093112] [2024-11-02 11:21:03,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:21:03,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:21:03,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:21:03,978 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 11:21:03,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-02 11:21:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:21:04,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-02 11:21:04,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 11:21:04,236 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-02 11:21:04,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 18 [2024-11-02 11:21:04,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-02 11:21:04,405 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-02 11:21:04,406 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-02 11:21:04,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-02 11:21:04,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-02 11:21:04,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 11:21:04,538 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_162 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ c_create_data_~data~0.offset 4))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_162) c_create_data_~data~0.base) .cse0))) 1)) is different from false [2024-11-02 11:21:04,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 11:21:04,556 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 24 treesize of output 25 [2024-11-02 11:21:04,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2024-11-02 11:21:04,572 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 9 treesize of output 5 [2024-11-02 11:21:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-02 11:21:04,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916093112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 11:21:04,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [615500535] [2024-11-02 11:21:04,631 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-02 11:21:04,632 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 11:21:04,636 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 11:21:04,641 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 11:21:04,642 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 11:21:04,943 INFO L197 IcfgInterpreter]: Interpreting procedure create_data with input of size 101 for LOIs [2024-11-02 11:21:06,754 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-02 11:21:09,497 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4143#(and (= create_data_~data~0.offset 0) (<= 1 |#StackHeapBarrier|) (= create_data_~prevData.base 0) (exists ((|v_create_data_#t~mem8.base_21| Int)) (not (= (select |#valid| |v_create_data_#t~mem8.base_21|) 1))) (= |create_data_#in~prevData.offset| 0) (= |create_data_#in~prevData.base| 0) (<= 0 create_data_~counter~0) (<= 0 (+ |create_data_#t~nondet9| 2147483648)) (<= |create_data_#t~nondet9| 2147483647) (= create_data_~prevData.offset 0))' at error location [2024-11-02 11:21:09,497 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-02 11:21:09,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-02 11:21:09,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2024-11-02 11:21:09,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209124708] [2024-11-02 11:21:09,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-02 11:21:09,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-02 11:21:09,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:21:09,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-02 11:21:09,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=524, Unknown=5, NotChecked=46, Total=650 [2024-11-02 11:21:09,500 INFO L87 Difference]: Start difference. First operand 171 states and 192 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 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 11:21:09,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:21:09,917 INFO L93 Difference]: Finished difference Result 172 states and 192 transitions. [2024-11-02 11:21:09,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 11:21:09,918 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 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 17 [2024-11-02 11:21:09,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:21:09,919 INFO L225 Difference]: With dead ends: 172 [2024-11-02 11:21:09,919 INFO L226 Difference]: Without dead ends: 172 [2024-11-02 11:21:09,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=75, Invalid=524, Unknown=5, NotChecked=46, Total=650 [2024-11-02 11:21:09,920 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 35 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-02 11:21:09,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 594 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 410 Invalid, 0 Unknown, 85 Unchecked, 0.4s Time] [2024-11-02 11:21:09,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-02 11:21:09,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2024-11-02 11:21:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 115 states have (on average 1.617391304347826) internal successors, (186), 165 states have internal predecessors, (186), 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 11:21:09,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 190 transitions. [2024-11-02 11:21:09,928 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 190 transitions. Word has length 17 [2024-11-02 11:21:09,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:21:09,929 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 190 transitions. [2024-11-02 11:21:09,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 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 11:21:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 190 transitions. [2024-11-02 11:21:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-02 11:21:09,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:21:09,930 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:21:09,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-02 11:21:10,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:21:10,131 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-02 11:21:10,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:21:10,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1416169510, now seen corresponding path program 1 times [2024-11-02 11:21:10,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:21:10,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77035688] [2024-11-02 11:21:10,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:21:10,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:21:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:21:10,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:21:10,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:21:10,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77035688] [2024-11-02 11:21:10,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77035688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 11:21:10,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897451353] [2024-11-02 11:21:10,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:21:10,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:21:10,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:21:10,638 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 11:21:10,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-02 11:21:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:21:10,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-02 11:21:10,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 11:21:10,775 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 8 treesize of output 1 [2024-11-02 11:21:10,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-02 11:21:10,794 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 10 treesize of output 8 [2024-11-02 11:21:10,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-02 11:21:10,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-02 11:21:10,954 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-02 11:21:10,954 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-02 11:21:10,966 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 30 treesize of output 13 [2024-11-02 11:21:11,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-02 11:21:11,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2024-11-02 11:21:11,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:21:11,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 11:21:11,121 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_create_data_~data~0.offset 4)) (.cse1 (* c_create_data_~counter~0 4))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem8.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem8.base| v_ArrVal_222) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_221 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem8.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0) .cse1 4))))) is different from false [2024-11-02 11:21:11,135 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse0 (* c_create_data_~counter~0 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_221 (Array Int Int)) (v_ArrVal_222 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_221) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_222) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_221 (Array Int Int))) (<= 0 (+ .cse0 4 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_221) c_create_data_~data~0.base) .cse2))))))) is different from false [2024-11-02 11:21:11,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 11:21:11,156 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 45 treesize of output 46 [2024-11-02 11:21:11,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 11:21:11,163 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 35 treesize of output 36 [2024-11-02 11:21:11,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2024-11-02 11:21:11,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2024-11-02 11:21:11,178 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 15 treesize of output 11 [2024-11-02 11:21:11,181 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 11 treesize of output 7 [2024-11-02 11:21:11,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 11:21:11,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-02 11:21:11,195 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-02 11:21:11,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2024-11-02 11:21:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-02 11:21:11,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897451353] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 11:21:11,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1690402749] [2024-11-02 11:21:11,228 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-02 11:21:11,228 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 11:21:11,228 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 11:21:11,228 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 11:21:11,228 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 11:21:11,369 INFO L197 IcfgInterpreter]: Interpreting procedure create_data with input of size 101 for LOIs [2024-11-02 11:21:12,467 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-02 11:21:15,346 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4611#(exists ((|v_create_data_#t~mem8.base_29| Int) (|v_create_data_#t~mem8.offset_25| Int) (v_create_data_~counter~0_32 Int)) (and (= create_data_~data~0.offset 0) (<= 0 v_create_data_~counter~0_32) (<= 1 |#StackHeapBarrier|) (= create_data_~prevData.base 0) (= |create_data_#in~prevData.offset| 0) (= |create_data_#in~prevData.base| 0) (or (< (select |#length| |v_create_data_#t~mem8.base_29|) (+ (* v_create_data_~counter~0_32 4) 4 |v_create_data_#t~mem8.offset_25|)) (< (+ (* v_create_data_~counter~0_32 4) |v_create_data_#t~mem8.offset_25|) 0)) (<= 0 (+ |create_data_#t~nondet9| 2147483648)) (<= |create_data_#t~nondet9| 2147483647) (= create_data_~prevData.offset 0)))' at error location [2024-11-02 11:21:15,347 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-02 11:21:15,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-02 11:21:15,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-11-02 11:21:15,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141404572] [2024-11-02 11:21:15,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-02 11:21:15,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-02 11:21:15,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:21:15,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-02 11:21:15,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=626, Unknown=2, NotChecked=102, Total=812 [2024-11-02 11:21:15,349 INFO L87 Difference]: Start difference. First operand 170 states and 190 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 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 11:21:15,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:21:15,992 INFO L93 Difference]: Finished difference Result 176 states and 196 transitions. [2024-11-02 11:21:15,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 11:21:15,993 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 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 17 [2024-11-02 11:21:15,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:21:15,994 INFO L225 Difference]: With dead ends: 176 [2024-11-02 11:21:15,994 INFO L226 Difference]: Without dead ends: 176 [2024-11-02 11:21:15,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=104, Invalid=772, Unknown=2, NotChecked=114, Total=992 [2024-11-02 11:21:15,996 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 4 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-02 11:21:15,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 553 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 421 Invalid, 0 Unknown, 157 Unchecked, 0.5s Time] [2024-11-02 11:21:15,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-02 11:21:16,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-11-02 11:21:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 121 states have (on average 1.5867768595041323) internal successors, (192), 171 states have internal predecessors, (192), 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 11:21:16,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 196 transitions. [2024-11-02 11:21:16,002 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 196 transitions. Word has length 17 [2024-11-02 11:21:16,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:21:16,002 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 196 transitions. [2024-11-02 11:21:16,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 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 11:21:16,002 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 196 transitions. [2024-11-02 11:21:16,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-02 11:21:16,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:21:16,003 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:21:16,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-02 11:21:16,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:21:16,205 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-11-02 11:21:16,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:21:16,205 INFO L85 PathProgramCache]: Analyzing trace with hash -350360893, now seen corresponding path program 2 times [2024-11-02 11:21:16,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:21:16,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734817947] [2024-11-02 11:21:16,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:21:16,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:21:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:21:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:21:16,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:21:16,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734817947] [2024-11-02 11:21:16,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734817947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 11:21:16,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123148480] [2024-11-02 11:21:16,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-02 11:21:16,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 11:21:16,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:21:16,737 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 11:21:16,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a793bf7b-d752-493d-9e8a-2886c84af89b/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-02 11:21:16,877 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-02 11:21:16,877 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-02 11:21:16,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-02 11:21:16,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 11:21:16,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-02 11:21:16,906 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 8 treesize of output 1 [2024-11-02 11:21:16,912 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 10 treesize of output 8 [2024-11-02 11:21:16,949 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 19 treesize of output 1 [2024-11-02 11:21:16,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-02 11:21:17,093 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-02 11:21:17,093 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-02 11:21:17,103 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 30 treesize of output 13 [2024-11-02 11:21:17,264 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-02 11:21:17,265 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-02 11:21:17,281 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 43 treesize of output 24 [2024-11-02 11:21:17,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-02 11:21:17,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 32 treesize of output 14 [2024-11-02 11:21:17,428 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:21:17,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 11:21:17,910 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_create_data_~data~0.offset 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (let ((.cse3 (* c_create_data_~counter~0 4)) (.cse0 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_293))) (or (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_294))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (< (+ (select (select (store .cse0 .cse1 v_ArrVal_296) c_create_data_~data~0.base) .cse2) .cse3 11) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_295) c_create_data_~data~0.base) .cse2))))) (< (+ .cse3 (select (select .cse0 c_create_data_~data~0.base) .cse2) 4) 0)))) (forall ((v_create_data_~counter~0_36 Int)) (or (< (+ c_create_data_~counter~0 1) v_create_data_~counter~0_36) (forall ((v_ArrVal_293 (Array Int Int))) (let ((.cse7 (* v_create_data_~counter~0_36 4)) (.cse6 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_293))) (or (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_296 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_294) c_create_data_~data~0.base) .cse2) v_ArrVal_296) c_create_data_~data~0.base) .cse2) .cse7 4))) (< (+ .cse7 (select (select .cse6 c_create_data_~data~0.base) .cse2)) 0))))))))) is different from false [2024-11-02 11:21:17,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 11:21:17,990 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 202 treesize of output 173 [2024-11-02 11:21:18,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-02 11:21:18,004 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 162 treesize of output 133 [2024-11-02 11:21:18,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 524 treesize of output 452 [2024-11-02 11:21:18,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 534 treesize of output 486 [2024-11-02 11:21:18,059 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 198 treesize of output 194 [2024-11-02 11:21:18,068 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 194 treesize of output 190 [2024-11-02 11:21:18,082 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 190 treesize of output 178 [2024-11-02 11:21:18,090 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 178 treesize of output 170 [2024-11-02 11:21:18,099 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 170 treesize of output 166 [2024-11-02 11:21:18,106 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 166 treesize of output 158 [2024-11-02 11:21:18,114 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 158 treesize of output 150 [2024-11-02 11:21:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-02 11:21:18,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123148480] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 11:21:18,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [673452547] [2024-11-02 11:21:18,223 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-02 11:21:18,224 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 11:21:18,224 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 11:21:18,224 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 11:21:18,224 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 11:21:18,351 INFO L197 IcfgInterpreter]: Interpreting procedure create_data with input of size 101 for LOIs [2024-11-02 11:21:19,437 INFO L180 IcfgInterpreter]: Interpretation finished