./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0232-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --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 1228d922512a0e9364273220ccc1e5afc3bfb7c0e22f10439a1ba902492e71b2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 09:13:04,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 09:13:04,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 09:13:04,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 09:13:04,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 09:13:04,850 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 09:13:04,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 09:13:04,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 09:13:04,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 09:13:04,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 09:13:04,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 09:13:04,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 09:13:04,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 09:13:04,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 09:13:04,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 09:13:04,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 09:13:04,858 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 09:13:04,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 09:13:04,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 09:13:04,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 09:13:04,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 09:13:04,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 09:13:04,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 09:13:04,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 09:13:04,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 09:13:04,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 09:13:04,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 09:13:04,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 09:13:04,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 09:13:04,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 09:13:04,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 09:13:04,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 09:13:04,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 09:13:04,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 09:13:04,870 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 09:13:04,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 09:13:04,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 09:13:04,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 09:13:04,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 09:13:04,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 09:13:04,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 09:13:04,873 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 09:13:04,887 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 09:13:04,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 09:13:04,887 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 09:13:04,887 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 09:13:04,888 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 09:13:04,888 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 09:13:04,888 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 09:13:04,888 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 09:13:04,888 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 09:13:04,888 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 09:13:04,888 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 09:13:04,889 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 09:13:04,889 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 09:13:04,889 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 09:13:04,889 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 09:13:04,889 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 09:13:04,889 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 09:13:04,889 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 09:13:04,890 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 09:13:04,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 09:13:04,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 09:13:04,890 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 09:13:04,890 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 09:13:04,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 09:13:04,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 09:13:04,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 09:13:04,891 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 09:13:04,891 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 09:13:04,891 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 09:13:04,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 09:13:04,891 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 09:13:04,892 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 09:13:04,892 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 09:13:04,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 09:13:04,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 09:13:04,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:13:04,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 09:13:04,892 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 09:13:04,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 09:13:04,893 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 09:13:04,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 09:13:04,893 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 09:13:04,893 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/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_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 1228d922512a0e9364273220ccc1e5afc3bfb7c0e22f10439a1ba902492e71b2 [2022-12-14 09:13:05,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 09:13:05,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 09:13:05,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 09:13:05,076 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 09:13:05,076 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 09:13:05,077 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/memsafety/test-0232-1.i [2022-12-14 09:13:07,686 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 09:13:07,868 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 09:13:07,869 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/sv-benchmarks/c/memsafety/test-0232-1.i [2022-12-14 09:13:07,879 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/data/f5f5b5bac/4d4e69bee2d04789981941371e4b4243/FLAG2c99c8894 [2022-12-14 09:13:07,891 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/data/f5f5b5bac/4d4e69bee2d04789981941371e4b4243 [2022-12-14 09:13:07,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 09:13:07,894 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 09:13:07,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 09:13:07,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 09:13:07,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 09:13:07,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:13:07" (1/1) ... [2022-12-14 09:13:07,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61398801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:07, skipping insertion in model container [2022-12-14 09:13:07,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:13:07" (1/1) ... [2022-12-14 09:13:07,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 09:13:07,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 09:13:08,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:13:08,172 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 09:13:08,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:13:08,225 INFO L208 MainTranslator]: Completed translation [2022-12-14 09:13:08,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:08 WrapperNode [2022-12-14 09:13:08,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 09:13:08,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 09:13:08,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 09:13:08,227 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 09:13:08,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:08" (1/1) ... [2022-12-14 09:13:08,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:08" (1/1) ... [2022-12-14 09:13:08,260 INFO L138 Inliner]: procedures = 126, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2022-12-14 09:13:08,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 09:13:08,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 09:13:08,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 09:13:08,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 09:13:08,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:08" (1/1) ... [2022-12-14 09:13:08,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:08" (1/1) ... [2022-12-14 09:13:08,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:08" (1/1) ... [2022-12-14 09:13:08,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:08" (1/1) ... [2022-12-14 09:13:08,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:08" (1/1) ... [2022-12-14 09:13:08,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:08" (1/1) ... [2022-12-14 09:13:08,282 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:08" (1/1) ... [2022-12-14 09:13:08,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:08" (1/1) ... [2022-12-14 09:13:08,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 09:13:08,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 09:13:08,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 09:13:08,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 09:13:08,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:08" (1/1) ... [2022-12-14 09:13:08,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:13:08,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:13:08,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 09:13:08,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 09:13:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 09:13:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 09:13:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 09:13:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 09:13:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 09:13:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 09:13:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-14 09:13:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 09:13:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 09:13:08,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 09:13:08,437 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 09:13:08,438 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 09:13:08,665 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 09:13:08,688 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 09:13:08,689 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 09:13:08,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:13:08 BoogieIcfgContainer [2022-12-14 09:13:08,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 09:13:08,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 09:13:08,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 09:13:08,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 09:13:08,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 09:13:07" (1/3) ... [2022-12-14 09:13:08,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c08fde8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:13:08, skipping insertion in model container [2022-12-14 09:13:08,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:08" (2/3) ... [2022-12-14 09:13:08,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c08fde8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:13:08, skipping insertion in model container [2022-12-14 09:13:08,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:13:08" (3/3) ... [2022-12-14 09:13:08,697 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2022-12-14 09:13:08,711 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 09:13:08,712 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-12-14 09:13:08,745 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 09:13:08,750 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@51685401, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 09:13:08,750 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-12-14 09:13:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 72 states have internal predecessors, (78), 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) [2022-12-14 09:13:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 09:13:08,758 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:08,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 09:13:08,759 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:08,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:08,763 INFO L85 PathProgramCache]: Analyzing trace with hash 147227, now seen corresponding path program 1 times [2022-12-14 09:13:08,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:13:08,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051186714] [2022-12-14 09:13:08,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:08,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:13:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:08,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:08,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:13:08,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051186714] [2022-12-14 09:13:08,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051186714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:08,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:08,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:13:08,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702488769] [2022-12-14 09:13:08,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:08,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:13:08,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:13:09,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:13:09,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:13:09,007 INFO L87 Difference]: Start difference. First operand has 73 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 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) [2022-12-14 09:13:09,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:09,118 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-12-14 09:13:09,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:13:09,120 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 [2022-12-14 09:13:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:09,126 INFO L225 Difference]: With dead ends: 83 [2022-12-14 09:13:09,126 INFO L226 Difference]: Without dead ends: 82 [2022-12-14 09:13:09,127 INFO L412 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 [2022-12-14 09:13:09,129 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 124 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:09,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 38 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:13:09,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-14 09:13:09,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 64. [2022-12-14 09:13:09,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 31 states have (on average 2.161290322580645) internal successors, (67), 63 states have internal predecessors, (67), 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) [2022-12-14 09:13:09,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2022-12-14 09:13:09,166 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 3 [2022-12-14 09:13:09,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:09,167 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2022-12-14 09:13:09,167 INFO L496 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) [2022-12-14 09:13:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-12-14 09:13:09,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 09:13:09,167 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:09,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 09:13:09,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 09:13:09,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:09,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:09,174 INFO L85 PathProgramCache]: Analyzing trace with hash 147228, now seen corresponding path program 1 times [2022-12-14 09:13:09,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:13:09,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122042079] [2022-12-14 09:13:09,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:09,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:13:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:09,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:09,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:13:09,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122042079] [2022-12-14 09:13:09,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122042079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:09,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:09,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:13:09,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539551152] [2022-12-14 09:13:09,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:09,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:13:09,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:13:09,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:13:09,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:13:09,293 INFO L87 Difference]: Start difference. First operand 64 states and 67 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) [2022-12-14 09:13:09,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:09,376 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2022-12-14 09:13:09,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:13:09,377 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 [2022-12-14 09:13:09,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:09,378 INFO L225 Difference]: With dead ends: 55 [2022-12-14 09:13:09,378 INFO L226 Difference]: Without dead ends: 55 [2022-12-14 09:13:09,378 INFO L412 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 [2022-12-14 09:13:09,380 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 106 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:09,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 24 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:13:09,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-14 09:13:09,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-12-14 09:13:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 53 states have internal predecessors, (57), 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) [2022-12-14 09:13:09,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-12-14 09:13:09,384 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 3 [2022-12-14 09:13:09,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:09,384 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-12-14 09:13:09,384 INFO L496 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) [2022-12-14 09:13:09,384 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-12-14 09:13:09,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 09:13:09,385 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:09,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 09:13:09,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 09:13:09,385 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:09,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:09,386 INFO L85 PathProgramCache]: Analyzing trace with hash 4564017, now seen corresponding path program 1 times [2022-12-14 09:13:09,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:13:09,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765792005] [2022-12-14 09:13:09,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:09,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:13:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:09,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:13:09,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765792005] [2022-12-14 09:13:09,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765792005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:09,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:09,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:13:09,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708802935] [2022-12-14 09:13:09,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:09,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:13:09,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:13:09,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:13:09,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:13:09,419 INFO L87 Difference]: Start difference. First operand 54 states and 57 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) [2022-12-14 09:13:09,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:09,478 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-12-14 09:13:09,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:13:09,479 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 [2022-12-14 09:13:09,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:09,479 INFO L225 Difference]: With dead ends: 65 [2022-12-14 09:13:09,479 INFO L226 Difference]: Without dead ends: 65 [2022-12-14 09:13:09,480 INFO L412 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 [2022-12-14 09:13:09,481 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:09,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 31 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:13:09,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-14 09:13:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2022-12-14 09:13:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 49 states have internal predecessors, (53), 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) [2022-12-14 09:13:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-12-14 09:13:09,486 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 4 [2022-12-14 09:13:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:09,487 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-12-14 09:13:09,487 INFO L496 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) [2022-12-14 09:13:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-12-14 09:13:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 09:13:09,487 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:09,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 09:13:09,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 09:13:09,488 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:09,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:09,489 INFO L85 PathProgramCache]: Analyzing trace with hash 4564018, now seen corresponding path program 1 times [2022-12-14 09:13:09,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:13:09,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578807541] [2022-12-14 09:13:09,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:09,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:13:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:09,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:09,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:13:09,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578807541] [2022-12-14 09:13:09,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578807541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:09,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:09,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:13:09,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059372351] [2022-12-14 09:13:09,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:09,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:13:09,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:13:09,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:13:09,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:13:09,553 INFO L87 Difference]: Start difference. First operand 50 states and 53 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) [2022-12-14 09:13:09,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:09,591 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-12-14 09:13:09,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:13:09,591 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 [2022-12-14 09:13:09,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:09,592 INFO L225 Difference]: With dead ends: 47 [2022-12-14 09:13:09,592 INFO L226 Difference]: Without dead ends: 47 [2022-12-14 09:13:09,592 INFO L412 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 [2022-12-14 09:13:09,594 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:09,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 27 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:13:09,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-14 09:13:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-12-14 09:13:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 45 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-12-14 09:13:09,598 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 4 [2022-12-14 09:13:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:09,599 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-12-14 09:13:09,599 INFO L496 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) [2022-12-14 09:13:09,599 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-12-14 09:13:09,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 09:13:09,599 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:09,599 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:09,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 09:13:09,600 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:09,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1702802726, now seen corresponding path program 1 times [2022-12-14 09:13:09,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:13:09,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17216180] [2022-12-14 09:13:09,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:09,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:13:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:09,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:13:09,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17216180] [2022-12-14 09:13:09,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17216180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:09,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:09,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 09:13:09,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520977121] [2022-12-14 09:13:09,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:09,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 09:13:09,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:13:09,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 09:13:09,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:13:09,790 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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) [2022-12-14 09:13:09,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:09,910 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-12-14 09:13:09,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 09:13:09,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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 [2022-12-14 09:13:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:09,911 INFO L225 Difference]: With dead ends: 54 [2022-12-14 09:13:09,911 INFO L226 Difference]: Without dead ends: 54 [2022-12-14 09:13:09,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-14 09:13:09,913 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:09,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 200 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:13:09,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-12-14 09:13:09,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2022-12-14 09:13:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.5) internal successors, (54), 50 states have internal predecessors, (54), 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) [2022-12-14 09:13:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-12-14 09:13:09,918 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 8 [2022-12-14 09:13:09,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:09,918 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-12-14 09:13:09,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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) [2022-12-14 09:13:09,918 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-12-14 09:13:09,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 09:13:09,919 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:09,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:09,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 09:13:09,919 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:09,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:09,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1766066188, now seen corresponding path program 1 times [2022-12-14 09:13:09,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:13:09,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986209631] [2022-12-14 09:13:09,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:09,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:13:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:10,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:10,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:13:10,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986209631] [2022-12-14 09:13:10,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986209631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:10,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:10,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 09:13:10,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214204537] [2022-12-14 09:13:10,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:10,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 09:13:10,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:13:10,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 09:13:10,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 09:13:10,071 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:10,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:10,155 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2022-12-14 09:13:10,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 09:13:10,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 09:13:10,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:10,156 INFO L225 Difference]: With dead ends: 64 [2022-12-14 09:13:10,156 INFO L226 Difference]: Without dead ends: 64 [2022-12-14 09:13:10,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 09:13:10,157 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 82 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:10,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 53 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:13:10,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-12-14 09:13:10,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2022-12-14 09:13:10,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 49 states have internal predecessors, (53), 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) [2022-12-14 09:13:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-12-14 09:13:10,162 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 13 [2022-12-14 09:13:10,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:10,162 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-12-14 09:13:10,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:10,162 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-12-14 09:13:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 09:13:10,163 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:10,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:10,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 09:13:10,163 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:10,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:10,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1766066189, now seen corresponding path program 1 times [2022-12-14 09:13:10,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:13:10,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551257393] [2022-12-14 09:13:10,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:10,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:13:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:10,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:13:10,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551257393] [2022-12-14 09:13:10,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551257393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:10,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:10,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 09:13:10,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721734182] [2022-12-14 09:13:10,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:10,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 09:13:10,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:13:10,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 09:13:10,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 09:13:10,339 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:10,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:10,428 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-12-14 09:13:10,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:13:10,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 09:13:10,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:10,428 INFO L225 Difference]: With dead ends: 65 [2022-12-14 09:13:10,429 INFO L226 Difference]: Without dead ends: 65 [2022-12-14 09:13:10,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 09:13:10,430 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 139 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:10,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 58 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:13:10,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-14 09:13:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2022-12-14 09:13:10,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-12-14 09:13:10,434 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 13 [2022-12-14 09:13:10,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:10,434 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-12-14 09:13:10,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-12-14 09:13:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 09:13:10,435 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:10,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:10,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 09:13:10,436 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:10,436 INFO L85 PathProgramCache]: Analyzing trace with hash 677583434, now seen corresponding path program 1 times [2022-12-14 09:13:10,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:13:10,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329257762] [2022-12-14 09:13:10,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:10,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:13:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:10,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:13:10,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329257762] [2022-12-14 09:13:10,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329257762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:10,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:10,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:13:10,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483228800] [2022-12-14 09:13:10,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:10,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:13:10,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:13:10,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:13:10,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:13:10,524 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:10,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:10,587 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2022-12-14 09:13:10,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 09:13:10,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 09:13:10,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:10,588 INFO L225 Difference]: With dead ends: 64 [2022-12-14 09:13:10,589 INFO L226 Difference]: Without dead ends: 64 [2022-12-14 09:13:10,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:13:10,590 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 83 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:10,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 58 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:13:10,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-12-14 09:13:10,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2022-12-14 09:13:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 47 states have internal predecessors, (51), 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) [2022-12-14 09:13:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2022-12-14 09:13:10,593 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 15 [2022-12-14 09:13:10,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:10,594 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2022-12-14 09:13:10,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-12-14 09:13:10,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 09:13:10,594 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:10,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:10,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 09:13:10,595 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:10,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:10,595 INFO L85 PathProgramCache]: Analyzing trace with hash 697691972, now seen corresponding path program 1 times [2022-12-14 09:13:10,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:13:10,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238441402] [2022-12-14 09:13:10,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:10,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:13:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:10,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:10,669 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:13:10,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238441402] [2022-12-14 09:13:10,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238441402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:10,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:10,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 09:13:10,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707589271] [2022-12-14 09:13:10,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:10,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:13:10,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:13:10,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:13:10,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:13:10,670 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:10,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:10,726 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-12-14 09:13:10,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:13:10,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 09:13:10,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:10,727 INFO L225 Difference]: With dead ends: 48 [2022-12-14 09:13:10,727 INFO L226 Difference]: Without dead ends: 48 [2022-12-14 09:13:10,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:13:10,728 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:10,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 62 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:13:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-12-14 09:13:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-12-14 09:13:10,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 47 states have internal predecessors, (50), 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) [2022-12-14 09:13:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2022-12-14 09:13:10,730 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 15 [2022-12-14 09:13:10,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:10,730 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2022-12-14 09:13:10,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:10,730 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-12-14 09:13:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 09:13:10,731 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:10,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:10,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 09:13:10,731 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:10,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:10,731 INFO L85 PathProgramCache]: Analyzing trace with hash -469749928, now seen corresponding path program 1 times [2022-12-14 09:13:10,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:13:10,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874786752] [2022-12-14 09:13:10,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:10,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:13:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:10,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:13:10,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874786752] [2022-12-14 09:13:10,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874786752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:10,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:10,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:13:10,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485953211] [2022-12-14 09:13:10,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:10,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:13:10,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:13:10,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:13:10,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:13:10,815 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:10,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:10,877 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-12-14 09:13:10,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 09:13:10,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 09:13:10,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:10,878 INFO L225 Difference]: With dead ends: 47 [2022-12-14 09:13:10,878 INFO L226 Difference]: Without dead ends: 47 [2022-12-14 09:13:10,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:13:10,879 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 46 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:10,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 44 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:13:10,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-14 09:13:10,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-12-14 09:13:10,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:10,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-12-14 09:13:10,882 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 16 [2022-12-14 09:13:10,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:10,882 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-12-14 09:13:10,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:10,882 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-12-14 09:13:10,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 09:13:10,882 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:10,882 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:10,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 09:13:10,882 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:10,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:10,883 INFO L85 PathProgramCache]: Analyzing trace with hash -2076654982, now seen corresponding path program 1 times [2022-12-14 09:13:10,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:13:10,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041730168] [2022-12-14 09:13:10,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:10,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:13:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:11,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:11,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:13:11,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041730168] [2022-12-14 09:13:11,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041730168] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:13:11,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261718620] [2022-12-14 09:13:11,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:11,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:13:11,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:13:11,094 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:13:11,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 09:13:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:11,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 09:13:11,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:13:11,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:13:11,355 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-14 09:13:11,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-12-14 09:13:11,426 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:13:11,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2022-12-14 09:13:11,483 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 09:13:11,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2022-12-14 09:13:11,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:11,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:13:11,575 INFO L350 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 38 treesize of output 34 [2022-12-14 09:13:11,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:13:11,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 103 treesize of output 255 [2022-12-14 09:13:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:12,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261718620] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:13:12,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2058933103] [2022-12-14 09:13:12,212 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-12-14 09:13:12,212 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:13:12,215 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:13:12,219 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:13:12,220 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:13:12,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 09:13:12,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-12-14 09:13:12,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-12-14 09:13:12,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-12-14 09:13:12,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 09:13:12,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2022-12-14 09:13:12,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 09:13:12,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-12-14 09:13:12,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-12-14 09:13:12,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-12-14 09:13:12,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 65 [2022-12-14 09:13:12,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 09:13:12,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 19 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 63 [2022-12-14 09:13:12,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 09:13:12,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,678 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:13:12,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 268 treesize of output 160 [2022-12-14 09:13:12,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2022-12-14 09:13:12,749 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:13:12,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-12-14 09:13:12,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 09:13:12,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-12-14 09:13:12,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 65 [2022-12-14 09:13:12,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-12-14 09:13:12,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:12,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 09:13:13,100 INFO L321 Elim1Store]: treesize reduction 190, result has 32.4 percent of original size [2022-12-14 09:13:13,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 344 treesize of output 407 [2022-12-14 09:13:14,449 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:13:14,456 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:13:14,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-14 09:13:14,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 09:13:14,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:13:14,480 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:13:14,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-14 09:13:14,539 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:13:16,412 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1365#(and (<= 0 |ULTIMATE.start_main_~#list~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_#t~mem6#1.base|) (<= 0 |#NULL.base|) (<= 0 |ULTIMATE.start_append_#in~plist#1.base|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_#t~mem5#1.base|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_append_~item~0#1.offset|) (or (not (= |ULTIMATE.start_append_#t~mem5#1.base| 0)) (not (= |ULTIMATE.start_append_#t~mem5#1.offset| 0))) (not (= (select |#valid| |ULTIMATE.start_append_#t~mem6#1.base|) 1)) (<= 0 |ULTIMATE.start_main_~#list~0#1.base|) (<= 0 |ULTIMATE.start_append_~plist#1.base|) (<= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_#t~mem5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (<= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= |ULTIMATE.start_append_#in~plist#1.offset| 0) (<= |#NULL.base| 0) (= |ULTIMATE.start_append_#t~mem6#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (<= 0 |ULTIMATE.start_append_~plist#1.offset|) (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 4) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (<= 0 |ULTIMATE.start_append_#in~plist#1.offset|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_append_~plist#1.offset| 0) (<= 0 |#StackHeapBarrier|))' at error location [2022-12-14 09:13:16,413 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:13:16,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:13:16,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-14 09:13:16,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562396698] [2022-12-14 09:13:16,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:13:16,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 09:13:16,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:13:16,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 09:13:16,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2022-12-14 09:13:16,415 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 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) [2022-12-14 09:13:16,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:16,770 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2022-12-14 09:13:16,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 09:13:16,770 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 09:13:16,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:16,771 INFO L225 Difference]: With dead ends: 60 [2022-12-14 09:13:16,771 INFO L226 Difference]: Without dead ends: 60 [2022-12-14 09:13:16,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 09:13:16,772 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 192 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:16,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 147 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 09:13:16,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-12-14 09:13:16,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2022-12-14 09:13:16,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 45 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2022-12-14 09:13:16,776 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 16 [2022-12-14 09:13:16,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:16,776 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-12-14 09:13:16,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 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) [2022-12-14 09:13:16,776 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-12-14 09:13:16,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 09:13:16,776 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:16,776 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:16,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 09:13:16,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:13:16,978 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:16,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:16,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2076654981, now seen corresponding path program 1 times [2022-12-14 09:13:16,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:13:16,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155524025] [2022-12-14 09:13:16,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:16,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:13:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:17,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:17,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:13:17,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155524025] [2022-12-14 09:13:17,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155524025] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:13:17,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39236961] [2022-12-14 09:13:17,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:17,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:13:17,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:13:17,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:13:17,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 09:13:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:17,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 09:13:17,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:13:17,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:13:17,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:13:17,426 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-14 09:13:17,426 INFO L350 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 16 treesize of output 26 [2022-12-14 09:13:17,438 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-14 09:13:17,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-14 09:13:17,504 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:13:17,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-12-14 09:13:17,515 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:13:17,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2022-12-14 09:13:17,578 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 09:13:17,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2022-12-14 09:13:17,583 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 09:13:17,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-12-14 09:13:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:17,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:13:19,738 INFO L350 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 32 treesize of output 28 [2022-12-14 09:13:19,748 INFO L350 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 66 treesize of output 62 [2022-12-14 09:13:19,751 INFO L350 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 102 treesize of output 94 [2022-12-14 09:13:27,966 WARN L233 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 33 DAG size of output: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:13:27,979 INFO L350 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 64 treesize of output 60 [2022-12-14 09:13:27,996 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:13:27,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 100 [2022-12-14 09:13:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:28,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39236961] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:13:28,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [103636928] [2022-12-14 09:13:28,080 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-12-14 09:13:28,080 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:13:28,080 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:13:28,081 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:13:28,081 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:13:28,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 09:13:28,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-12-14 09:13:28,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-12-14 09:13:28,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-12-14 09:13:28,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 09:13:28,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2022-12-14 09:13:28,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-12-14 09:13:28,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 09:13:28,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-12-14 09:13:28,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 68 [2022-12-14 09:13:28,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-12-14 09:13:28,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 09:13:28,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 19 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 78 [2022-12-14 09:13:28,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,447 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-12-14 09:13:28,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 330 treesize of output 180 [2022-12-14 09:13:28,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,475 INFO L321 Elim1Store]: treesize reduction 80, result has 22.3 percent of original size [2022-12-14 09:13:28,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 286 treesize of output 249 [2022-12-14 09:13:28,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 09:13:28,526 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:13:28,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-12-14 09:13:28,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-12-14 09:13:28,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-12-14 09:13:28,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-12-14 09:13:28,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-12-14 09:13:28,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:28,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 65 [2022-12-14 09:13:28,877 INFO L321 Elim1Store]: treesize reduction 190, result has 32.4 percent of original size [2022-12-14 09:13:28,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 344 treesize of output 407 [2022-12-14 09:13:30,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:13:30,129 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:13:30,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-14 09:13:30,137 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:13:30,143 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:13:30,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-14 09:13:30,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 09:13:30,199 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:13:32,323 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1608#(and (<= 0 |ULTIMATE.start_main_~#list~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_#t~mem6#1.base|) (<= 0 |#NULL.base|) (<= 0 |ULTIMATE.start_append_#in~plist#1.base|) (or (not (<= (+ |ULTIMATE.start_append_#t~mem6#1.offset| 8) (select |#length| |ULTIMATE.start_append_#t~mem6#1.base|))) (not (<= 0 (+ |ULTIMATE.start_append_#t~mem6#1.offset| 4)))) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_#t~mem5#1.base|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_append_~item~0#1.offset|) (or (not (= |ULTIMATE.start_append_#t~mem5#1.base| 0)) (not (= |ULTIMATE.start_append_#t~mem5#1.offset| 0))) (<= 0 |ULTIMATE.start_main_~#list~0#1.base|) (<= 0 |ULTIMATE.start_append_~plist#1.base|) (<= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_#t~mem5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (<= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= |ULTIMATE.start_append_#in~plist#1.offset| 0) (<= |#NULL.base| 0) (= |ULTIMATE.start_append_#t~mem6#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (<= 0 |ULTIMATE.start_append_~plist#1.offset|) (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 4) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (<= 0 |ULTIMATE.start_append_#in~plist#1.offset|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_append_~plist#1.offset| 0) (<= 0 |#StackHeapBarrier|))' at error location [2022-12-14 09:13:32,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:13:32,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:13:32,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-14 09:13:32,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736844744] [2022-12-14 09:13:32,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:13:32,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 09:13:32,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:13:32,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 09:13:32,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 09:13:32,325 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:32,918 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2022-12-14 09:13:32,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 09:13:32,919 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 09:13:32,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:32,919 INFO L225 Difference]: With dead ends: 61 [2022-12-14 09:13:32,919 INFO L226 Difference]: Without dead ends: 61 [2022-12-14 09:13:32,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 09:13:32,920 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 107 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:32,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 196 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 09:13:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-12-14 09:13:32,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2022-12-14 09:13:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-12-14 09:13:32,922 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 16 [2022-12-14 09:13:32,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:32,922 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-12-14 09:13:32,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:32,922 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-12-14 09:13:32,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 09:13:32,922 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:32,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:32,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 09:13:33,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 09:13:33,124 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:33,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:33,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1677345780, now seen corresponding path program 1 times [2022-12-14 09:13:33,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:13:33,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594645097] [2022-12-14 09:13:33,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:33,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:13:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:33,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:13:33,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594645097] [2022-12-14 09:13:33,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594645097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:33,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:33,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:13:33,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212965569] [2022-12-14 09:13:33,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:33,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:13:33,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:13:33,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:13:33,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:13:33,174 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-12-14 09:13:33,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:33,239 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-12-14 09:13:33,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:13:33,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-12-14 09:13:33,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:33,239 INFO L225 Difference]: With dead ends: 44 [2022-12-14 09:13:33,240 INFO L226 Difference]: Without dead ends: 44 [2022-12-14 09:13:33,240 INFO L412 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 [2022-12-14 09:13:33,240 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:33,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 70 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:13:33,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-14 09:13:33,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-12-14 09:13:33,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 43 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-12-14 09:13:33,243 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 17 [2022-12-14 09:13:33,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:33,243 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-12-14 09:13:33,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-12-14 09:13:33,243 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-12-14 09:13:33,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 09:13:33,244 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:33,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:33,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 09:13:33,244 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:33,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:33,244 INFO L85 PathProgramCache]: Analyzing trace with hash -458111525, now seen corresponding path program 1 times [2022-12-14 09:13:33,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:13:33,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695366354] [2022-12-14 09:13:33,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:33,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:13:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:33,355 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:13:33,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695366354] [2022-12-14 09:13:33,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695366354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:33,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:33,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:13:33,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070196734] [2022-12-14 09:13:33,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:33,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 09:13:33,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:13:33,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 09:13:33,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 09:13:33,357 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:33,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:33,436 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-12-14 09:13:33,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 09:13:33,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 09:13:33,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:33,437 INFO L225 Difference]: With dead ends: 43 [2022-12-14 09:13:33,437 INFO L226 Difference]: Without dead ends: 43 [2022-12-14 09:13:33,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-14 09:13:33,438 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 54 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:33,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 32 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:13:33,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-14 09:13:33,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-12-14 09:13:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.25) internal successors, (45), 42 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-12-14 09:13:33,440 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 18 [2022-12-14 09:13:33,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:33,440 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-12-14 09:13:33,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-12-14 09:13:33,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 09:13:33,440 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:33,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:33,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 09:13:33,441 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:33,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:33,441 INFO L85 PathProgramCache]: Analyzing trace with hash 141357921, now seen corresponding path program 1 times [2022-12-14 09:13:33,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:13:33,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714835694] [2022-12-14 09:13:33,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:33,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:13:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 09:13:33,460 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 09:13:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 09:13:33,487 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 09:13:33,487 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 09:13:33,488 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (40 of 41 remaining) [2022-12-14 09:13:33,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 41 remaining) [2022-12-14 09:13:33,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 41 remaining) [2022-12-14 09:13:33,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 41 remaining) [2022-12-14 09:13:33,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 41 remaining) [2022-12-14 09:13:33,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 41 remaining) [2022-12-14 09:13:33,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 41 remaining) [2022-12-14 09:13:33,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 41 remaining) [2022-12-14 09:13:33,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 41 remaining) [2022-12-14 09:13:33,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 41 remaining) [2022-12-14 09:13:33,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 41 remaining) [2022-12-14 09:13:33,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 41 remaining) [2022-12-14 09:13:33,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 41 remaining) [2022-12-14 09:13:33,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 41 remaining) [2022-12-14 09:13:33,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 41 remaining) [2022-12-14 09:13:33,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 41 remaining) [2022-12-14 09:13:33,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 41 remaining) [2022-12-14 09:13:33,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 41 remaining) [2022-12-14 09:13:33,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 41 remaining) [2022-12-14 09:13:33,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 41 remaining) [2022-12-14 09:13:33,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 41 remaining) [2022-12-14 09:13:33,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 41 remaining) [2022-12-14 09:13:33,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 41 remaining) [2022-12-14 09:13:33,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE (17 of 41 remaining) [2022-12-14 09:13:33,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE (16 of 41 remaining) [2022-12-14 09:13:33,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE (15 of 41 remaining) [2022-12-14 09:13:33,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 41 remaining) [2022-12-14 09:13:33,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 41 remaining) [2022-12-14 09:13:33,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 41 remaining) [2022-12-14 09:13:33,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 41 remaining) [2022-12-14 09:13:33,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 41 remaining) [2022-12-14 09:13:33,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 41 remaining) [2022-12-14 09:13:33,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 41 remaining) [2022-12-14 09:13:33,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 41 remaining) [2022-12-14 09:13:33,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 41 remaining) [2022-12-14 09:13:33,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 41 remaining) [2022-12-14 09:13:33,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (4 of 41 remaining) [2022-12-14 09:13:33,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (3 of 41 remaining) [2022-12-14 09:13:33,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE (2 of 41 remaining) [2022-12-14 09:13:33,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 41 remaining) [2022-12-14 09:13:33,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 41 remaining) [2022-12-14 09:13:33,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 09:13:33,495 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:33,497 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 09:13:33,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 09:13:33 BoogieIcfgContainer [2022-12-14 09:13:33,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 09:13:33,514 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 09:13:33,514 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 09:13:33,514 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 09:13:33,514 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:13:08" (3/4) ... [2022-12-14 09:13:33,516 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 09:13:33,517 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 09:13:33,517 INFO L158 Benchmark]: Toolchain (without parser) took 25622.75ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 126.8MB in the beginning and 58.9MB in the end (delta: 67.9MB). Peak memory consumption was 103.3MB. Max. memory is 16.1GB. [2022-12-14 09:13:33,517 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 165.7MB. Free memory was 127.2MB in the beginning and 127.1MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 09:13:33,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.37ms. Allocated memory is still 165.7MB. Free memory was 126.8MB in the beginning and 110.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 09:13:33,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.61ms. Allocated memory is still 165.7MB. Free memory was 110.1MB in the beginning and 108.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 09:13:33,517 INFO L158 Benchmark]: Boogie Preprocessor took 24.03ms. Allocated memory is still 165.7MB. Free memory was 108.0MB in the beginning and 106.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 09:13:33,518 INFO L158 Benchmark]: RCFGBuilder took 404.34ms. Allocated memory is still 165.7MB. Free memory was 106.6MB in the beginning and 86.3MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 09:13:33,518 INFO L158 Benchmark]: TraceAbstraction took 24820.97ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 85.6MB in the beginning and 58.9MB in the end (delta: 26.7MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2022-12-14 09:13:33,518 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 199.2MB. Free memory is still 58.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 09:13:33,519 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 165.7MB. Free memory was 127.2MB in the beginning and 127.1MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.37ms. Allocated memory is still 165.7MB. Free memory was 126.8MB in the beginning and 110.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.61ms. Allocated memory is still 165.7MB. Free memory was 110.1MB in the beginning and 108.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.03ms. Allocated memory is still 165.7MB. Free memory was 108.0MB in the beginning and 106.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 404.34ms. Allocated memory is still 165.7MB. Free memory was 106.6MB in the beginning and 86.3MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 24820.97ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 85.6MB in the beginning and 58.9MB in the end (delta: 26.7MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 199.2MB. Free memory is still 58.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 537]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 537. Possible FailurePath: [L539] struct item *list = ((void *)0); VAL [list={6:0}] [L541] CALL append(&list) [L530] struct item *item = malloc(sizeof *item); [L531] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={3:0}, plist={6:0}, plist={6:0}] [L531] item->next = *plist [L532] EXPR item->next VAL [item={3:0}, item->next={0:0}, plist={6:0}, plist={6:0}] [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-1:0}, item={3:0}, item->next={0:0}, malloc(sizeof *item)={-1:0}, plist={6:0}, plist={6:0}] [L532-L534] item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L535] *plist = item [L541] RET append(&list) [L542] COND FALSE !(__VERIFIER_nondet_int()) [L543] \read(*list) VAL [\read(*list)={3:0}, list={6:0}] [L543] COND TRUE \read(*list) [L544] EXPR \read(*list) VAL [\read(*list)={3:0}, list={6:0}] [L544] EXPR list->next [L544] struct item *next = list->next; [L545] EXPR \read(*list) VAL [\read(*list)={3:0}, list={6:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={3:0}, list={6:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={3:0}, list={6:0}, next={0:0}] [L545] free(list) [L546] list = next VAL [list={6:0}, next={0:0}] [L548] \read(*list) VAL [\read(*list)={0:0}, list={6:0}, next={0:0}] [L548] COND FALSE !(\read(*list)) [L553] return 0; [L539] struct item *list = ((void *)0); [L553] return 0; VAL [\result=0, next={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 73 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 24.8s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1082 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1082 mSDsluCounter, 1040 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 707 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1584 IncrementalHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 333 mSDtfsCounter, 1584 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 15.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=0, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 114 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 207 ConstructedInterpolants, 14 QuantifiedInterpolants, 2382 SizeOfPredicates, 41 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 6/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-14 09:13:33,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --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 1228d922512a0e9364273220ccc1e5afc3bfb7c0e22f10439a1ba902492e71b2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 09:13:35,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 09:13:35,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 09:13:35,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 09:13:35,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 09:13:35,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 09:13:35,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 09:13:35,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 09:13:35,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 09:13:35,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 09:13:35,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 09:13:35,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 09:13:35,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 09:13:35,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 09:13:35,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 09:13:35,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 09:13:35,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 09:13:35,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 09:13:35,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 09:13:35,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 09:13:35,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 09:13:35,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 09:13:35,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 09:13:35,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 09:13:35,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 09:13:35,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 09:13:35,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 09:13:35,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 09:13:35,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 09:13:35,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 09:13:35,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 09:13:35,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 09:13:35,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 09:13:35,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 09:13:35,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 09:13:35,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 09:13:35,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 09:13:35,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 09:13:35,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 09:13:35,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 09:13:35,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 09:13:35,210 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-12-14 09:13:35,225 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 09:13:35,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 09:13:35,225 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 09:13:35,225 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 09:13:35,226 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 09:13:35,226 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 09:13:35,226 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 09:13:35,226 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 09:13:35,226 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 09:13:35,227 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 09:13:35,227 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 09:13:35,227 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 09:13:35,227 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 09:13:35,227 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 09:13:35,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 09:13:35,228 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 09:13:35,228 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 09:13:35,228 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 09:13:35,228 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 09:13:35,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 09:13:35,229 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 09:13:35,229 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 09:13:35,229 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 09:13:35,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 09:13:35,229 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 09:13:35,229 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 09:13:35,230 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 09:13:35,230 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 09:13:35,230 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 09:13:35,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 09:13:35,230 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 09:13:35,230 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 09:13:35,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:13:35,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 09:13:35,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 09:13:35,236 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 09:13:35,236 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 09:13:35,236 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 09:13:35,236 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 09:13:35,236 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/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_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 1228d922512a0e9364273220ccc1e5afc3bfb7c0e22f10439a1ba902492e71b2 [2022-12-14 09:13:35,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 09:13:35,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 09:13:35,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 09:13:35,467 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 09:13:35,467 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 09:13:35,469 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/memsafety/test-0232-1.i [2022-12-14 09:13:38,147 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 09:13:38,345 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 09:13:38,345 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/sv-benchmarks/c/memsafety/test-0232-1.i [2022-12-14 09:13:38,356 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/data/bc8783747/77f771762f6946b88c0c6904d4139d4c/FLAGd438e9d97 [2022-12-14 09:13:38,368 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/data/bc8783747/77f771762f6946b88c0c6904d4139d4c [2022-12-14 09:13:38,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 09:13:38,371 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 09:13:38,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 09:13:38,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 09:13:38,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 09:13:38,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:13:38" (1/1) ... [2022-12-14 09:13:38,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e5ecec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:38, skipping insertion in model container [2022-12-14 09:13:38,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:13:38" (1/1) ... [2022-12-14 09:13:38,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 09:13:38,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 09:13:38,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:13:38,639 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 09:13:38,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:13:38,696 INFO L208 MainTranslator]: Completed translation [2022-12-14 09:13:38,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:38 WrapperNode [2022-12-14 09:13:38,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 09:13:38,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 09:13:38,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 09:13:38,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 09:13:38,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:38" (1/1) ... [2022-12-14 09:13:38,719 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:38" (1/1) ... [2022-12-14 09:13:38,737 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2022-12-14 09:13:38,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 09:13:38,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 09:13:38,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 09:13:38,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 09:13:38,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:38" (1/1) ... [2022-12-14 09:13:38,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:38" (1/1) ... [2022-12-14 09:13:38,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:38" (1/1) ... [2022-12-14 09:13:38,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:38" (1/1) ... [2022-12-14 09:13:38,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:38" (1/1) ... [2022-12-14 09:13:38,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:38" (1/1) ... [2022-12-14 09:13:38,761 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:38" (1/1) ... [2022-12-14 09:13:38,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:38" (1/1) ... [2022-12-14 09:13:38,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 09:13:38,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 09:13:38,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 09:13:38,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 09:13:38,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:38" (1/1) ... [2022-12-14 09:13:38,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:13:38,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:13:38,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 09:13:38,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 09:13:38,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 09:13:38,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 09:13:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 09:13:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 09:13:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 09:13:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 09:13:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-14 09:13:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 09:13:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 09:13:38,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 09:13:38,934 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 09:13:38,935 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 09:13:39,304 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 09:13:39,311 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 09:13:39,312 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 09:13:39,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:13:39 BoogieIcfgContainer [2022-12-14 09:13:39,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 09:13:39,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 09:13:39,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 09:13:39,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 09:13:39,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 09:13:38" (1/3) ... [2022-12-14 09:13:39,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9a7df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:13:39, skipping insertion in model container [2022-12-14 09:13:39,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:13:38" (2/3) ... [2022-12-14 09:13:39,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9a7df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:13:39, skipping insertion in model container [2022-12-14 09:13:39,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:13:39" (3/3) ... [2022-12-14 09:13:39,323 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232-1.i [2022-12-14 09:13:39,341 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 09:13:39,342 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-12-14 09:13:39,378 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 09:13:39,384 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@4ed2e3ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 09:13:39,384 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-12-14 09:13:39,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 80 states have internal predecessors, (86), 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) [2022-12-14 09:13:39,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 09:13:39,393 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:39,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 09:13:39,394 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:39,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:39,398 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-12-14 09:13:39,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:13:39,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585218252] [2022-12-14 09:13:39,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:39,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:39,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:13:39,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:13:39,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-14 09:13:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:39,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 09:13:39,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:13:39,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 09:13:39,582 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:13:39,583 INFO L350 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 14 treesize of output 20 [2022-12-14 09:13:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:39,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:13:39,602 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:13:39,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585218252] [2022-12-14 09:13:39,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585218252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:39,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:39,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:13:39,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293666017] [2022-12-14 09:13:39,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:39,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:13:39,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:13:39,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:13:39,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:13:39,635 INFO L87 Difference]: Start difference. First operand has 81 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 80 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2022-12-14 09:13:39,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:39,872 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-12-14 09:13:39,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:13:39,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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 [2022-12-14 09:13:39,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:39,880 INFO L225 Difference]: With dead ends: 92 [2022-12-14 09:13:39,880 INFO L226 Difference]: Without dead ends: 90 [2022-12-14 09:13:39,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:13:39,883 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 137 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:39,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 51 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 09:13:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-12-14 09:13:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 71. [2022-12-14 09:13:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 70 states have internal predecessors, (74), 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) [2022-12-14 09:13:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-12-14 09:13:39,907 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 4 [2022-12-14 09:13:39,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:39,908 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-12-14 09:13:39,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2022-12-14 09:13:39,908 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-12-14 09:13:39,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 09:13:39,908 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:39,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 09:13:39,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-14 09:13:40,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:40,110 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:40,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:40,110 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-12-14 09:13:40,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:13:40,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275151331] [2022-12-14 09:13:40,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:40,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:40,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:13:40,114 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:13:40,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-14 09:13:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:40,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 09:13:40,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:13:40,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 09:13:40,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 09:13:40,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:40,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 09:13:40,343 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 09:13:40,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 09:13:40,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:40,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:13:40,357 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:13:40,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275151331] [2022-12-14 09:13:40,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275151331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:40,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:40,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:13:40,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305074123] [2022-12-14 09:13:40,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:40,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:13:40,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:13:40,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:13:40,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:13:40,361 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2022-12-14 09:13:40,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:40,723 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2022-12-14 09:13:40,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:13:40,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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 [2022-12-14 09:13:40,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:40,724 INFO L225 Difference]: With dead ends: 145 [2022-12-14 09:13:40,724 INFO L226 Difference]: Without dead ends: 145 [2022-12-14 09:13:40,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:13:40,725 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 134 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:40,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 89 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 09:13:40,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-12-14 09:13:40,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 76. [2022-12-14 09:13:40,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 75 states have internal predecessors, (84), 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) [2022-12-14 09:13:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2022-12-14 09:13:40,730 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 4 [2022-12-14 09:13:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:40,731 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2022-12-14 09:13:40,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2022-12-14 09:13:40,731 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-12-14 09:13:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 09:13:40,731 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:40,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 09:13:40,739 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-14 09:13:40,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:40,933 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:40,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:40,935 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2022-12-14 09:13:40,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:13:40,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335754723] [2022-12-14 09:13:40,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:40,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:40,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:13:40,966 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:13:40,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-14 09:13:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:41,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 09:13:41,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:13:41,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 09:13:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:41,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:13:41,067 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:13:41,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335754723] [2022-12-14 09:13:41,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335754723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:41,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:41,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:13:41,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261218626] [2022-12-14 09:13:41,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:41,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:13:41,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:13:41,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:13:41,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:13:41,069 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:41,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:41,184 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-12-14 09:13:41,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:13:41,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 09:13:41,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:41,185 INFO L225 Difference]: With dead ends: 82 [2022-12-14 09:13:41,186 INFO L226 Difference]: Without dead ends: 82 [2022-12-14 09:13:41,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:13:41,187 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 48 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:41,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 51 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:13:41,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-14 09:13:41,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2022-12-14 09:13:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 71 states have internal predecessors, (79), 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) [2022-12-14 09:13:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-12-14 09:13:41,192 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 5 [2022-12-14 09:13:41,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:41,192 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-12-14 09:13:41,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:41,192 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-12-14 09:13:41,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 09:13:41,193 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:41,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 09:13:41,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-14 09:13:41,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:41,395 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:41,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:41,396 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2022-12-14 09:13:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:13:41,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164620532] [2022-12-14 09:13:41,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:41,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:41,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:13:41,400 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:13:41,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-14 09:13:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:41,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 09:13:41,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:13:41,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 09:13:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:41,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:13:41,472 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:13:41,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164620532] [2022-12-14 09:13:41,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164620532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:41,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:41,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:13:41,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847239981] [2022-12-14 09:13:41,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:41,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:13:41,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:13:41,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:13:41,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:13:41,474 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:41,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:41,571 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2022-12-14 09:13:41,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:13:41,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 09:13:41,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:41,572 INFO L225 Difference]: With dead ends: 69 [2022-12-14 09:13:41,572 INFO L226 Difference]: Without dead ends: 69 [2022-12-14 09:13:41,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:13:41,573 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:41,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 35 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:13:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-14 09:13:41,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-12-14 09:13:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.574468085106383) internal successors, (74), 67 states have internal predecessors, (74), 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) [2022-12-14 09:13:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-12-14 09:13:41,576 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 5 [2022-12-14 09:13:41,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:41,577 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-12-14 09:13:41,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:41,577 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-12-14 09:13:41,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 09:13:41,577 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:41,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:41,584 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-14 09:13:41,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:41,779 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:41,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:41,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2022-12-14 09:13:41,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:13:41,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169653609] [2022-12-14 09:13:41,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:41,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:41,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:13:41,786 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:13:41,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-14 09:13:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:41,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 09:13:41,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:13:41,994 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:13:41,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-12-14 09:13:42,015 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:13:42,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-12-14 09:13:42,093 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 09:13:42,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-12-14 09:13:42,098 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 09:13:42,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-12-14 09:13:42,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:42,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:13:42,118 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:13:42,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169653609] [2022-12-14 09:13:42,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169653609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:42,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:42,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 09:13:42,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643464158] [2022-12-14 09:13:42,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:42,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 09:13:42,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:13:42,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 09:13:42,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:13:42,120 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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) [2022-12-14 09:13:42,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:42,635 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-12-14 09:13:42,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 09:13:42,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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 10 [2022-12-14 09:13:42,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:42,636 INFO L225 Difference]: With dead ends: 78 [2022-12-14 09:13:42,636 INFO L226 Difference]: Without dead ends: 78 [2022-12-14 09:13:42,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-12-14 09:13:42,637 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 16 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:42,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 270 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 09:13:42,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-14 09:13:42,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2022-12-14 09:13:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.509433962264151) internal successors, (80), 73 states have internal predecessors, (80), 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) [2022-12-14 09:13:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2022-12-14 09:13:42,641 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 10 [2022-12-14 09:13:42,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:42,641 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2022-12-14 09:13:42,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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) [2022-12-14 09:13:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-12-14 09:13:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 09:13:42,641 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:42,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:42,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-14 09:13:42,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:42,843 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:42,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:42,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1762075788, now seen corresponding path program 1 times [2022-12-14 09:13:42,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:13:42,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006728729] [2022-12-14 09:13:42,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:42,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:42,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:13:42,848 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:13:42,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-14 09:13:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:42,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 09:13:42,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:13:42,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:13:42,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 09:13:43,000 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 09:13:43,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 09:13:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:43,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:13:43,029 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:13:43,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006728729] [2022-12-14 09:13:43,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006728729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:43,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:43,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 09:13:43,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652878193] [2022-12-14 09:13:43,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:43,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 09:13:43,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:13:43,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 09:13:43,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 09:13:43,031 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:43,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:43,194 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-12-14 09:13:43,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 09:13:43,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 09:13:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:43,195 INFO L225 Difference]: With dead ends: 82 [2022-12-14 09:13:43,195 INFO L226 Difference]: Without dead ends: 82 [2022-12-14 09:13:43,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-12-14 09:13:43,196 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 208 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:43,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 37 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:13:43,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-14 09:13:43,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2022-12-14 09:13:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 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) [2022-12-14 09:13:43,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2022-12-14 09:13:43,200 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 11 [2022-12-14 09:13:43,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:43,201 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2022-12-14 09:13:43,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:43,201 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-12-14 09:13:43,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 09:13:43,201 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:43,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:43,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-14 09:13:43,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:43,403 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:43,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:43,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1870051159, now seen corresponding path program 1 times [2022-12-14 09:13:43,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:13:43,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547641800] [2022-12-14 09:13:43,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:43,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:43,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:13:43,406 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:13:43,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-14 09:13:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:43,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 09:13:43,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:13:43,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:13:43,582 INFO L350 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 19 treesize of output 11 [2022-12-14 09:13:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:43,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:13:43,591 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:13:43,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547641800] [2022-12-14 09:13:43,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547641800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:43,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:43,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 09:13:43,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297233414] [2022-12-14 09:13:43,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:43,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 09:13:43,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:13:43,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 09:13:43,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 09:13:43,592 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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) [2022-12-14 09:13:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:43,837 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-12-14 09:13:43,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 09:13:43,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2022-12-14 09:13:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:43,838 INFO L225 Difference]: With dead ends: 78 [2022-12-14 09:13:43,838 INFO L226 Difference]: Without dead ends: 78 [2022-12-14 09:13:43,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 09:13:43,839 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 133 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:43,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 72 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 09:13:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-14 09:13:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2022-12-14 09:13:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.5) internal successors, (75), 68 states have internal predecessors, (75), 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) [2022-12-14 09:13:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-12-14 09:13:43,842 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 17 [2022-12-14 09:13:43,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:43,843 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-12-14 09:13:43,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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) [2022-12-14 09:13:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-12-14 09:13:43,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 09:13:43,843 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:43,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:43,853 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-14 09:13:44,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:44,045 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:44,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:44,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1870051160, now seen corresponding path program 1 times [2022-12-14 09:13:44,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:13:44,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609659412] [2022-12-14 09:13:44,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:44,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:44,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:13:44,057 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:13:44,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-14 09:13:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:44,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 09:13:44,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:13:44,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:13:44,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:13:44,267 INFO L350 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 17 treesize of output 9 [2022-12-14 09:13:44,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 09:13:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:44,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:13:44,288 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:13:44,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609659412] [2022-12-14 09:13:44,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609659412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:44,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:44,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 09:13:44,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617496184] [2022-12-14 09:13:44,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:44,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 09:13:44,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:13:44,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 09:13:44,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 09:13:44,289 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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) [2022-12-14 09:13:44,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:44,583 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-12-14 09:13:44,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:13:44,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2022-12-14 09:13:44,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:44,584 INFO L225 Difference]: With dead ends: 80 [2022-12-14 09:13:44,584 INFO L226 Difference]: Without dead ends: 80 [2022-12-14 09:13:44,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 09:13:44,585 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 102 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:44,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 77 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 09:13:44,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-14 09:13:44,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2022-12-14 09:13:44,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.48) internal successors, (74), 67 states have internal predecessors, (74), 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) [2022-12-14 09:13:44,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-12-14 09:13:44,588 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 17 [2022-12-14 09:13:44,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:44,588 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-12-14 09:13:44,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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) [2022-12-14 09:13:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-12-14 09:13:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 09:13:44,589 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:44,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:44,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-14 09:13:44,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:44,790 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:44,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:44,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1843001263, now seen corresponding path program 1 times [2022-12-14 09:13:44,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:13:44,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872100046] [2022-12-14 09:13:44,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:44,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:44,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:13:44,797 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:13:44,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-14 09:13:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:44,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 09:13:44,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:13:44,938 INFO L350 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 11 treesize of output 7 [2022-12-14 09:13:44,951 INFO L350 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 16 treesize of output 8 [2022-12-14 09:13:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:44,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:13:44,959 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:13:44,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872100046] [2022-12-14 09:13:44,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872100046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:44,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:44,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 09:13:44,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563619425] [2022-12-14 09:13:44,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:44,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:13:44,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:13:44,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:13:44,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:13:44,960 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2022-12-14 09:13:45,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:45,147 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-12-14 09:13:45,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:13:45,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2022-12-14 09:13:45,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:45,148 INFO L225 Difference]: With dead ends: 62 [2022-12-14 09:13:45,148 INFO L226 Difference]: Without dead ends: 62 [2022-12-14 09:13:45,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:13:45,149 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 63 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:45,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 89 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 09:13:45,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-12-14 09:13:45,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-12-14 09:13:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 61 states have internal predecessors, (64), 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) [2022-12-14 09:13:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-12-14 09:13:45,151 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 19 [2022-12-14 09:13:45,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:45,151 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-12-14 09:13:45,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2022-12-14 09:13:45,152 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-12-14 09:13:45,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 09:13:45,152 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:45,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:45,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-14 09:13:45,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:45,355 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:45,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:45,356 INFO L85 PathProgramCache]: Analyzing trace with hash 673311177, now seen corresponding path program 1 times [2022-12-14 09:13:45,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:13:45,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324355545] [2022-12-14 09:13:45,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:45,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:45,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:13:45,360 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:13:45,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-14 09:13:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:45,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 09:13:45,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:13:45,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:13:45,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 09:13:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:45,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:13:45,537 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:13:45,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324355545] [2022-12-14 09:13:45,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324355545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:45,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:45,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:13:45,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346624539] [2022-12-14 09:13:45,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:45,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:13:45,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:13:45,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:13:45,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:13:45,545 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:45,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:45,686 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-12-14 09:13:45,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 09:13:45,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 09:13:45,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:45,687 INFO L225 Difference]: With dead ends: 61 [2022-12-14 09:13:45,687 INFO L226 Difference]: Without dead ends: 61 [2022-12-14 09:13:45,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:13:45,688 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:45,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 81 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:13:45,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-12-14 09:13:45,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-12-14 09:13:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 60 states have internal predecessors, (63), 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) [2022-12-14 09:13:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-12-14 09:13:45,690 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 20 [2022-12-14 09:13:45,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:45,690 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-12-14 09:13:45,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:13:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-12-14 09:13:45,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 09:13:45,691 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:45,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:45,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-14 09:13:45,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:45,893 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:45,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:45,895 INFO L85 PathProgramCache]: Analyzing trace with hash -602189896, now seen corresponding path program 1 times [2022-12-14 09:13:45,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:13:45,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832788691] [2022-12-14 09:13:45,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:45,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:45,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:13:45,900 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:13:45,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-14 09:13:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:45,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 09:13:45,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:13:46,085 INFO L350 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 11 treesize of output 7 [2022-12-14 09:13:46,140 INFO L350 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 23 treesize of output 11 [2022-12-14 09:13:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:46,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:13:46,162 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:13:46,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832788691] [2022-12-14 09:13:46,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832788691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:13:46,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:13:46,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:13:46,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328122302] [2022-12-14 09:13:46,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:13:46,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 09:13:46,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:13:46,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 09:13:46,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 09:13:46,163 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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) [2022-12-14 09:13:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:46,430 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-12-14 09:13:46,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 09:13:46,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 21 [2022-12-14 09:13:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:46,432 INFO L225 Difference]: With dead ends: 60 [2022-12-14 09:13:46,432 INFO L226 Difference]: Without dead ends: 60 [2022-12-14 09:13:46,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-14 09:13:46,432 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 90 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:46,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 65 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 09:13:46,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-12-14 09:13:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-12-14 09:13:46,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 59 states have internal predecessors, (62), 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) [2022-12-14 09:13:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-12-14 09:13:46,436 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 21 [2022-12-14 09:13:46,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:46,436 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-12-14 09:13:46,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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) [2022-12-14 09:13:46,436 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-12-14 09:13:46,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 09:13:46,436 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:46,436 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:46,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-14 09:13:46,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:46,638 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:46,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:46,639 INFO L85 PathProgramCache]: Analyzing trace with hash 717052317, now seen corresponding path program 1 times [2022-12-14 09:13:46,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:13:46,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545397123] [2022-12-14 09:13:46,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:46,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:46,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:13:46,645 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:13:46,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-12-14 09:13:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:46,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 09:13:46,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:13:46,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:13:46,826 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-12-14 09:13:46,826 INFO L350 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 18 treesize of output 24 [2022-12-14 09:13:46,893 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:13:46,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-12-14 09:13:46,963 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 09:13:46,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2022-12-14 09:13:46,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:46,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:13:47,074 INFO L350 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 36 treesize of output 32 [2022-12-14 09:13:47,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:47,170 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:13:47,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545397123] [2022-12-14 09:13:47,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545397123] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:13:47,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [989443546] [2022-12-14 09:13:47,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:47,171 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 09:13:47,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 09:13:47,171 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 09:13:47,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-12-14 09:13:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:47,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 09:13:47,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:13:47,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:13:47,500 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-12-14 09:13:47,500 INFO L350 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 18 treesize of output 24 [2022-12-14 09:13:47,618 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:13:47,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-12-14 09:13:47,694 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 09:13:47,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2022-12-14 09:13:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:47,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:13:47,737 INFO L350 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 36 treesize of output 32 [2022-12-14 09:13:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:47,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [989443546] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:13:47,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417172317] [2022-12-14 09:13:47,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:47,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:13:47,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:13:47,825 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:13:47,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 09:13:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:47,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 09:13:47,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:13:47,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:13:47,980 INFO L321 Elim1Store]: treesize reduction 34, result has 37.0 percent of original size [2022-12-14 09:13:47,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 35 [2022-12-14 09:13:48,091 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:13:48,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2022-12-14 09:13:48,177 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 09:13:48,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 18 [2022-12-14 09:13:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:48,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:13:48,222 INFO L350 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 36 treesize of output 32 [2022-12-14 09:13:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:48,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417172317] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:13:48,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 09:13:48,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9, 8, 8, 8] total 22 [2022-12-14 09:13:48,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117852690] [2022-12-14 09:13:48,308 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 09:13:48,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 09:13:48,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:13:48,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 09:13:48,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-12-14 09:13:48,309 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 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) [2022-12-14 09:13:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:13:49,694 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-12-14 09:13:49,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 09:13:49,695 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 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 21 [2022-12-14 09:13:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:13:49,696 INFO L225 Difference]: With dead ends: 77 [2022-12-14 09:13:49,696 INFO L226 Difference]: Without dead ends: 77 [2022-12-14 09:13:49,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 94 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=229, Invalid=763, Unknown=0, NotChecked=0, Total=992 [2022-12-14 09:13:49,697 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 208 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 09:13:49,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 254 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 09:13:49,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-14 09:13:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2022-12-14 09:13:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 58 states have internal predecessors, (61), 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) [2022-12-14 09:13:49,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-12-14 09:13:49,701 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 21 [2022-12-14 09:13:49,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:13:49,701 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-12-14 09:13:49,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 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) [2022-12-14 09:13:49,701 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-12-14 09:13:49,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 09:13:49,702 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:13:49,702 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:13:49,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-12-14 09:13:49,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2022-12-14 09:13:50,111 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 09:13:50,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:13:50,304 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:13:50,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:13:50,305 INFO L85 PathProgramCache]: Analyzing trace with hash 717052318, now seen corresponding path program 1 times [2022-12-14 09:13:50,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:13:50,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861802667] [2022-12-14 09:13:50,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:13:50,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:13:50,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:13:50,310 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:13:50,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-12-14 09:13:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:13:50,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 09:13:50,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:13:50,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 09:13:50,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:13:50,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:13:50,533 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-12-14 09:13:50,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-12-14 09:13:50,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 09:13:50,625 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:13:50,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2022-12-14 09:13:50,655 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:13:50,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-12-14 09:13:50,714 INFO L350 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 25 treesize of output 13 [2022-12-14 09:13:50,717 INFO L350 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 15 treesize of output 7 [2022-12-14 09:13:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:13:50,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:13:53,169 INFO L350 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 32 [2022-12-14 09:13:53,194 INFO L350 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 66 treesize of output 62 [2022-12-14 09:13:53,197 INFO L350 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 102 treesize of output 94 [2022-12-14 09:14:02,824 WARN L233 SmtUtils]: Spent 8.54s on a formula simplification. DAG size of input: 63 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:14:03,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:14:03,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 147 [2022-12-14 09:14:05,474 INFO L350 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 24 treesize of output 22 [2022-12-14 09:14:05,499 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:14:05,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 80 [2022-12-14 09:14:05,596 INFO L350 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 24 treesize of output 22 [2022-12-14 09:14:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:14:05,742 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:14:05,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861802667] [2022-12-14 09:14:05,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861802667] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:14:05,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1694820235] [2022-12-14 09:14:05,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:14:05,743 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 09:14:05,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 09:14:05,744 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 09:14:05,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-12-14 09:14:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:14:05,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 09:14:05,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:14:05,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 09:14:05,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 09:14:06,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:14:06,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 09:14:06,103 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 09:14:06,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 09:14:06,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:14:06,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:14:06,290 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-12-14 09:14:06,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-12-14 09:14:06,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 09:14:06,473 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:14:06,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-12-14 09:14:06,496 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:14:06,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2022-12-14 09:14:06,665 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 09:14:06,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-12-14 09:14:06,672 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 09:14:06,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2022-12-14 09:14:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:14:06,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:14:07,334 INFO L350 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 32 [2022-12-14 09:14:07,352 INFO L350 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 66 treesize of output 62 [2022-12-14 09:14:07,355 INFO L350 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 102 treesize of output 94 [2022-12-14 09:14:21,163 WARN L233 SmtUtils]: Spent 8.40s on a formula simplification. DAG size of input: 63 DAG size of output: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:14:21,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:14:21,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 102 [2022-12-14 09:14:41,161 WARN L233 SmtUtils]: Spent 6.43s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:14:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:14:41,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1694820235] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:14:41,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560689631] [2022-12-14 09:14:41,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:14:41,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:14:41,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:14:41,450 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:14:41,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 09:14:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:14:41,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 09:14:41,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:14:41,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:14:41,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:14:41,664 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-14 09:14:41,664 INFO L350 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 16 treesize of output 26 [2022-12-14 09:14:41,683 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-12-14 09:14:41,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-12-14 09:14:41,731 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:14:41,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-12-14 09:14:41,757 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:14:41,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2022-12-14 09:14:41,820 INFO L350 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 25 treesize of output 13 [2022-12-14 09:14:41,827 INFO L350 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 15 treesize of output 7 [2022-12-14 09:14:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:14:41,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:14:44,145 INFO L350 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 32 [2022-12-14 09:14:44,162 INFO L350 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 66 treesize of output 62 [2022-12-14 09:14:44,165 INFO L350 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 102 treesize of output 94 [2022-12-14 09:14:49,563 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2022-12-14 09:14:49,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 95 [2022-12-14 09:14:49,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:14:49,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 116 [2022-12-14 09:14:49,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:14:49,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560689631] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:14:49,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 09:14:49,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9, 9, 8, 8] total 27 [2022-12-14 09:14:49,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446174430] [2022-12-14 09:14:49,726 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 09:14:49,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 09:14:49,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:14:49,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 09:14:49,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=648, Unknown=10, NotChecked=0, Total=756 [2022-12-14 09:14:49,727 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 states have internal predecessors, (71), 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) [2022-12-14 09:14:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:14:52,725 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-12-14 09:14:52,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 09:14:52,726 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 states have internal predecessors, (71), 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 21 [2022-12-14 09:14:52,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:14:52,727 INFO L225 Difference]: With dead ends: 79 [2022-12-14 09:14:52,727 INFO L226 Difference]: Without dead ends: 79 [2022-12-14 09:14:52,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 55.6s TimeCoverageRelationStatistics Valid=274, Invalid=1048, Unknown=10, NotChecked=0, Total=1332 [2022-12-14 09:14:52,728 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 167 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:14:52,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 342 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-12-14 09:14:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-14 09:14:52,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 58. [2022-12-14 09:14:52,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 57 states have internal predecessors, (60), 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) [2022-12-14 09:14:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-12-14 09:14:52,731 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 21 [2022-12-14 09:14:52,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:14:52,731 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-12-14 09:14:52,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 states have internal predecessors, (71), 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) [2022-12-14 09:14:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-12-14 09:14:52,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 09:14:52,732 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:14:52,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:14:52,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2022-12-14 09:14:52,947 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-12-14 09:14:53,147 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 09:14:53,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:14:53,335 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:14:53,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:14:53,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1488017493, now seen corresponding path program 1 times [2022-12-14 09:14:53,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:14:53,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45460680] [2022-12-14 09:14:53,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:14:53,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:14:53,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:14:53,339 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:14:53,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-12-14 09:14:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:14:53,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 09:14:53,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:14:53,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:14:53,512 INFO L350 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 19 treesize of output 11 [2022-12-14 09:14:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:14:53,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:14:53,526 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:14:53,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45460680] [2022-12-14 09:14:53,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45460680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:14:53,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:14:53,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 09:14:53,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623279153] [2022-12-14 09:14:53,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:14:53,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 09:14:53,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:14:53,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 09:14:53,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 09:14:53,528 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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) [2022-12-14 09:14:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:14:53,806 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-12-14 09:14:53,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 09:14:53,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2022-12-14 09:14:53,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:14:53,807 INFO L225 Difference]: With dead ends: 57 [2022-12-14 09:14:53,807 INFO L226 Difference]: Without dead ends: 57 [2022-12-14 09:14:53,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 09:14:53,807 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 66 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:14:53,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 65 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 09:14:53,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-14 09:14:53,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-12-14 09:14:53,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 56 states have internal predecessors, (59), 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) [2022-12-14 09:14:53,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-12-14 09:14:53,809 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 22 [2022-12-14 09:14:53,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:14:53,809 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-12-14 09:14:53,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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) [2022-12-14 09:14:53,810 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-12-14 09:14:53,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 09:14:53,810 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:14:53,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:14:53,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-12-14 09:14:54,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:14:54,012 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:14:54,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:14:54,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1116098075, now seen corresponding path program 1 times [2022-12-14 09:14:54,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:14:54,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646582649] [2022-12-14 09:14:54,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:14:54,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:14:54,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:14:54,018 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:14:54,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-12-14 09:14:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:14:54,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 09:14:54,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:14:54,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 09:14:54,133 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 09:14:54,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 09:14:54,209 INFO L350 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 11 treesize of output 7 [2022-12-14 09:14:54,267 INFO L350 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 16 treesize of output 8 [2022-12-14 09:14:54,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 09:14:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:14:54,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:14:54,299 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:14:54,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646582649] [2022-12-14 09:14:54,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646582649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:14:54,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:14:54,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 09:14:54,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399576949] [2022-12-14 09:14:54,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:14:54,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 09:14:54,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:14:54,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 09:14:54,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 09:14:54,300 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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) [2022-12-14 09:14:54,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:14:54,567 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-12-14 09:14:54,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 09:14:54,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 23 [2022-12-14 09:14:54,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:14:54,568 INFO L225 Difference]: With dead ends: 56 [2022-12-14 09:14:54,568 INFO L226 Difference]: Without dead ends: 56 [2022-12-14 09:14:54,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-14 09:14:54,569 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 71 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:14:54,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 48 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 09:14:54,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-12-14 09:14:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-12-14 09:14:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 55 states have internal predecessors, (58), 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) [2022-12-14 09:14:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-12-14 09:14:54,570 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 23 [2022-12-14 09:14:54,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:14:54,570 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-12-14 09:14:54,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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) [2022-12-14 09:14:54,571 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-12-14 09:14:54,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 09:14:54,571 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:14:54,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:14:54,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-12-14 09:14:54,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:14:54,772 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:14:54,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:14:54,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1116098076, now seen corresponding path program 1 times [2022-12-14 09:14:54,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:14:54,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931338935] [2022-12-14 09:14:54,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:14:54,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:14:54,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:14:54,777 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:14:54,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-12-14 09:14:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:14:54,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 09:14:54,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:14:54,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:14:54,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:14:54,978 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:14:54,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931338935] [2022-12-14 09:14:54,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931338935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:14:54,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:14:54,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:14:54,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678520111] [2022-12-14 09:14:54,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:14:54,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:14:54,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:14:54,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:14:54,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:14:54,979 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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) [2022-12-14 09:14:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:14:55,068 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2022-12-14 09:14:55,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:14:55,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2022-12-14 09:14:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:14:55,069 INFO L225 Difference]: With dead ends: 51 [2022-12-14 09:14:55,069 INFO L226 Difference]: Without dead ends: 51 [2022-12-14 09:14:55,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:14:55,069 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 32 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:14:55,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 28 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:14:55,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-12-14 09:14:55,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-12-14 09:14:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 50 states have internal predecessors, (53), 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) [2022-12-14 09:14:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2022-12-14 09:14:55,071 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 23 [2022-12-14 09:14:55,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:14:55,071 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-12-14 09:14:55,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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) [2022-12-14 09:14:55,071 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-12-14 09:14:55,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 09:14:55,071 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:14:55,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:14:55,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-12-14 09:14:55,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:14:55,273 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-14 09:14:55,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:14:55,274 INFO L85 PathProgramCache]: Analyzing trace with hash -599596191, now seen corresponding path program 1 times [2022-12-14 09:14:55,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:14:55,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32624269] [2022-12-14 09:14:55,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:14:55,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:14:55,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:14:55,278 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:14:55,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-12-14 09:14:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 09:14:55,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 09:14:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 09:14:55,669 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-12-14 09:14:55,670 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 09:14:55,670 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (40 of 41 remaining) [2022-12-14 09:14:55,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 41 remaining) [2022-12-14 09:14:55,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 41 remaining) [2022-12-14 09:14:55,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 41 remaining) [2022-12-14 09:14:55,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 41 remaining) [2022-12-14 09:14:55,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 41 remaining) [2022-12-14 09:14:55,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 41 remaining) [2022-12-14 09:14:55,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 41 remaining) [2022-12-14 09:14:55,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 41 remaining) [2022-12-14 09:14:55,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 41 remaining) [2022-12-14 09:14:55,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 41 remaining) [2022-12-14 09:14:55,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 41 remaining) [2022-12-14 09:14:55,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 41 remaining) [2022-12-14 09:14:55,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 41 remaining) [2022-12-14 09:14:55,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 41 remaining) [2022-12-14 09:14:55,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 41 remaining) [2022-12-14 09:14:55,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 41 remaining) [2022-12-14 09:14:55,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 41 remaining) [2022-12-14 09:14:55,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 41 remaining) [2022-12-14 09:14:55,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 41 remaining) [2022-12-14 09:14:55,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 41 remaining) [2022-12-14 09:14:55,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 41 remaining) [2022-12-14 09:14:55,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 41 remaining) [2022-12-14 09:14:55,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE (17 of 41 remaining) [2022-12-14 09:14:55,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE (16 of 41 remaining) [2022-12-14 09:14:55,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE (15 of 41 remaining) [2022-12-14 09:14:55,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 41 remaining) [2022-12-14 09:14:55,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 41 remaining) [2022-12-14 09:14:55,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 41 remaining) [2022-12-14 09:14:55,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 41 remaining) [2022-12-14 09:14:55,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 41 remaining) [2022-12-14 09:14:55,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 41 remaining) [2022-12-14 09:14:55,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 41 remaining) [2022-12-14 09:14:55,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 41 remaining) [2022-12-14 09:14:55,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 41 remaining) [2022-12-14 09:14:55,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 41 remaining) [2022-12-14 09:14:55,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (4 of 41 remaining) [2022-12-14 09:14:55,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (3 of 41 remaining) [2022-12-14 09:14:55,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE (2 of 41 remaining) [2022-12-14 09:14:55,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 41 remaining) [2022-12-14 09:14:55,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 41 remaining) [2022-12-14 09:14:55,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-12-14 09:14:55,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:14:55,880 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:14:55,888 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 09:14:55,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 09:14:55 BoogieIcfgContainer [2022-12-14 09:14:55,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 09:14:55,930 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 09:14:55,930 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 09:14:55,931 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 09:14:55,931 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:13:39" (3/4) ... [2022-12-14 09:14:55,933 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 09:14:55,933 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 09:14:55,934 INFO L158 Benchmark]: Toolchain (without parser) took 77562.72ms. Allocated memory was 75.5MB in the beginning and 98.6MB in the end (delta: 23.1MB). Free memory was 54.5MB in the beginning and 41.3MB in the end (delta: 13.2MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2022-12-14 09:14:55,934 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 75.5MB. Free memory is still 54.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 09:14:55,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.31ms. Allocated memory is still 75.5MB. Free memory was 54.3MB in the beginning and 37.1MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 09:14:55,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.38ms. Allocated memory is still 75.5MB. Free memory was 37.1MB in the beginning and 34.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 09:14:55,934 INFO L158 Benchmark]: Boogie Preprocessor took 27.90ms. Allocated memory is still 75.5MB. Free memory was 34.9MB in the beginning and 33.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 09:14:55,934 INFO L158 Benchmark]: RCFGBuilder took 547.77ms. Allocated memory was 75.5MB in the beginning and 98.6MB in the end (delta: 23.1MB). Free memory was 33.2MB in the beginning and 58.3MB in the end (delta: -25.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 09:14:55,935 INFO L158 Benchmark]: TraceAbstraction took 76613.40ms. Allocated memory is still 98.6MB. Free memory was 57.9MB in the beginning and 41.4MB in the end (delta: 16.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2022-12-14 09:14:55,935 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 98.6MB. Free memory was 41.4MB in the beginning and 41.3MB in the end (delta: 63.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 09:14:55,935 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 75.5MB. Free memory is still 54.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.31ms. Allocated memory is still 75.5MB. Free memory was 54.3MB in the beginning and 37.1MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.38ms. Allocated memory is still 75.5MB. Free memory was 37.1MB in the beginning and 34.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.90ms. Allocated memory is still 75.5MB. Free memory was 34.9MB in the beginning and 33.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 547.77ms. Allocated memory was 75.5MB in the beginning and 98.6MB in the end (delta: 23.1MB). Free memory was 33.2MB in the beginning and 58.3MB in the end (delta: -25.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 76613.40ms. Allocated memory is still 98.6MB. Free memory was 57.9MB in the beginning and 41.4MB in the end (delta: 16.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 98.6MB. Free memory was 41.4MB in the beginning and 41.3MB in the end (delta: 63.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 537]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 537. Possible FailurePath: [L539] struct item *list = ((void *)0); VAL [list={10:0}] [L541] CALL append(&list) [L530] struct item *item = malloc(sizeof *item); [L531] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={3:0}, plist={10:0}, plist={10:0}] [L531] item->next = *plist VAL [\read(**plist)={0:0}, item={3:0}, plist={10:0}, plist={10:0}] [L532] EXPR item->next VAL [item={3:0}, item->next={0:0}, plist={10:0}, plist={10:0}] [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L532-L534] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={7:0}, item={3:0}, item->next={0:0}, malloc(sizeof *item)={7:0}, plist={10:0}, plist={10:0}] [L532-L534] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={7:0}, item={3:0}, item->next={0:0}, malloc(sizeof *item)={7:0}, plist={10:0}, plist={10:0}] [L535] *plist = item VAL [item={3:0}, plist={10:0}, plist={10:0}] [L541] RET append(&list) [L542] COND FALSE !(__VERIFIER_nondet_int()) [L543] \read(*list) VAL [\read(*list)={3:0}, list={10:0}] [L543] COND TRUE \read(*list) [L544] EXPR \read(*list) VAL [\read(*list)={3:0}, list={10:0}] [L544] EXPR list->next VAL [\read(*list)={3:0}, list={10:0}, list->next={0:0}] [L544] struct item *next = list->next; [L545] EXPR \read(*list) VAL [\read(*list)={3:0}, list={10:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={3:0}, list={10:0}, next={0:0}] [L545] free(list) VAL [\read(*list)={3:0}, list={10:0}, next={0:0}] [L545] free(list) [L546] list = next VAL [list={10:0}, next={0:0}] [L548] \read(*list) VAL [\read(*list)={0:0}, list={10:0}, next={0:0}] [L548] COND FALSE !(\read(*list)) [L553] return 0; [L539] struct item *list = ((void *)0); [L553] return 0; VAL [\result=0, next={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 81 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 76.5s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1592 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1592 mSDsluCounter, 1654 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1116 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2229 IncrementalHoareTripleChecker+Invalid, 2329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 538 mSDtfsCounter, 2229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 471 GetRequests, 328 SyntacticMatches, 9 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 57.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 175 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 62.1s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 427 ConstructedInterpolants, 53 QuantifiedInterpolants, 6850 SizeOfPredicates, 206 NumberOfNonLiveVariables, 2239 ConjunctsInSsa, 294 ConjunctsInUnsatCore, 26 InterpolantComputations, 14 PerfectInterpolantSequences, 12/72 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-14 09:14:55,975 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09bc022d-e1bc-43ac-b739-f8c2fb9b74d0/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample