./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrlen_unsafe.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 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_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrlen_unsafe.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1fa4bda6bd30ba2cdf5e016e12b6593fa4b1ef45b4dc13eb01e28da7c534ab67 --- 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-4e7fbc6 [2022-11-23 01:50:17,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 01:50:17,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 01:50:17,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 01:50:17,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 01:50:17,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 01:50:17,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 01:50:17,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 01:50:17,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 01:50:17,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 01:50:17,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 01:50:17,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 01:50:17,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 01:50:17,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 01:50:17,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 01:50:17,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 01:50:17,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 01:50:17,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 01:50:17,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 01:50:17,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 01:50:17,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 01:50:17,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 01:50:17,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 01:50:17,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 01:50:17,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 01:50:17,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 01:50:17,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 01:50:17,834 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 01:50:17,835 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 01:50:17,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 01:50:17,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 01:50:17,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 01:50:17,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 01:50:17,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 01:50:17,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 01:50:17,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 01:50:17,844 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 01:50:17,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 01:50:17,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 01:50:17,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 01:50:17,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 01:50:17,847 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-23 01:50:17,894 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 01:50:17,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 01:50:17,895 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 01:50:17,896 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 01:50:17,897 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 01:50:17,897 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 01:50:17,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 01:50:17,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 01:50:17,898 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 01:50:17,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 01:50:17,899 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 01:50:17,900 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 01:50:17,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 01:50:17,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 01:50:17,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 01:50:17,901 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 01:50:17,901 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 01:50:17,901 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 01:50:17,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 01:50:17,901 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 01:50:17,902 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 01:50:17,902 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 01:50:17,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 01:50:17,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 01:50:17,903 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 01:50:17,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:50:17,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 01:50:17,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 01:50:17,904 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 01:50:17,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 01:50:17,904 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 01:50:17,905 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 01:50:17,905 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 01:50:17,905 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/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_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1fa4bda6bd30ba2cdf5e016e12b6593fa4b1ef45b4dc13eb01e28da7c534ab67 [2022-11-23 01:50:18,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 01:50:18,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 01:50:18,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 01:50:18,211 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 01:50:18,211 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 01:50:18,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/array-memsafety/cstrlen_unsafe.i [2022-11-23 01:50:21,383 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 01:50:21,730 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 01:50:21,731 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/sv-benchmarks/c/array-memsafety/cstrlen_unsafe.i [2022-11-23 01:50:21,746 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/data/16f758d83/8ac9b55ce2d54a49a8fabe715ed89070/FLAGcb4972f70 [2022-11-23 01:50:21,765 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/data/16f758d83/8ac9b55ce2d54a49a8fabe715ed89070 [2022-11-23 01:50:21,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 01:50:21,770 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 01:50:21,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 01:50:21,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 01:50:21,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 01:50:21,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:50:21" (1/1) ... [2022-11-23 01:50:21,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1843b551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:21, skipping insertion in model container [2022-11-23 01:50:21,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:50:21" (1/1) ... [2022-11-23 01:50:21,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 01:50:21,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 01:50:22,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:50:22,149 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 01:50:22,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:50:22,249 INFO L208 MainTranslator]: Completed translation [2022-11-23 01:50:22,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:22 WrapperNode [2022-11-23 01:50:22,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 01:50:22,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 01:50:22,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 01:50:22,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 01:50:22,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:22" (1/1) ... [2022-11-23 01:50:22,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:22" (1/1) ... [2022-11-23 01:50:22,314 INFO L138 Inliner]: procedures = 118, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2022-11-23 01:50:22,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 01:50:22,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 01:50:22,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 01:50:22,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 01:50:22,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:22" (1/1) ... [2022-11-23 01:50:22,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:22" (1/1) ... [2022-11-23 01:50:22,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:22" (1/1) ... [2022-11-23 01:50:22,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:22" (1/1) ... [2022-11-23 01:50:22,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:22" (1/1) ... [2022-11-23 01:50:22,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:22" (1/1) ... [2022-11-23 01:50:22,363 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:22" (1/1) ... [2022-11-23 01:50:22,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:22" (1/1) ... [2022-11-23 01:50:22,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 01:50:22,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 01:50:22,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 01:50:22,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 01:50:22,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:22" (1/1) ... [2022-11-23 01:50:22,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:50:22,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:50:22,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 01:50:22,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 01:50:22,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 01:50:22,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 01:50:22,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 01:50:22,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 01:50:22,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 01:50:22,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 01:50:22,599 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 01:50:22,601 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 01:50:22,856 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 01:50:22,862 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 01:50:22,862 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-23 01:50:22,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:22 BoogieIcfgContainer [2022-11-23 01:50:22,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 01:50:22,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 01:50:22,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 01:50:22,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 01:50:22,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:50:21" (1/3) ... [2022-11-23 01:50:22,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6403acf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:50:22, skipping insertion in model container [2022-11-23 01:50:22,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:22" (2/3) ... [2022-11-23 01:50:22,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6403acf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:50:22, skipping insertion in model container [2022-11-23 01:50:22,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:22" (3/3) ... [2022-11-23 01:50:22,896 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrlen_unsafe.i [2022-11-23 01:50:22,948 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 01:50:22,948 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-11-23 01:50:23,017 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 01:50:23,025 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=PETRI_NET, 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;@6142243c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 01:50:23,025 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-23 01:50:23,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.75) internal successors, (35), 30 states have internal predecessors, (35), 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-11-23 01:50:23,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 01:50:23,038 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:50:23,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 01:50:23,039 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 01:50:23,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:50:23,048 INFO L85 PathProgramCache]: Analyzing trace with hash 889508873, now seen corresponding path program 1 times [2022-11-23 01:50:23,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:50:23,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711689858] [2022-11-23 01:50:23,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:50:23,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:50:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:50:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:50:23,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:50:23,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711689858] [2022-11-23 01:50:23,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711689858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:50:23,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:50:23,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:50:23,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321832976] [2022-11-23 01:50:23,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:50:23,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:50:23,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:50:23,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:50:23,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:50:23,543 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.75) internal successors, (35), 30 states have internal predecessors, (35), 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, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-11-23 01:50:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:50:23,648 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-11-23 01:50:23,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 01:50:23,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2022-11-23 01:50:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:50:23,662 INFO L225 Difference]: With dead ends: 54 [2022-11-23 01:50:23,663 INFO L226 Difference]: Without dead ends: 50 [2022-11-23 01:50:23,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-23 01:50:23,673 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 01:50:23,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 76 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 01:50:23,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-23 01:50:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2022-11-23 01:50:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 30 states have internal predecessors, (33), 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-11-23 01:50:23,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-11-23 01:50:23,723 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 6 [2022-11-23 01:50:23,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:50:23,724 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-11-23 01:50:23,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-11-23 01:50:23,724 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-11-23 01:50:23,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 01:50:23,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:50:23,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 01:50:23,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 01:50:23,728 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 01:50:23,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:50:23,729 INFO L85 PathProgramCache]: Analyzing trace with hash 889508820, now seen corresponding path program 1 times [2022-11-23 01:50:23,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:50:23,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377603833] [2022-11-23 01:50:23,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:50:23,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:50:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:50:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:50:23,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:50:23,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377603833] [2022-11-23 01:50:23,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377603833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:50:23,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:50:23,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 01:50:23,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917567030] [2022-11-23 01:50:23,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:50:23,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 01:50:23,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:50:23,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 01:50:23,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 01:50:23,899 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-23 01:50:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:50:23,941 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-11-23 01:50:23,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 01:50:23,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-11-23 01:50:23,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:50:23,944 INFO L225 Difference]: With dead ends: 29 [2022-11-23 01:50:23,945 INFO L226 Difference]: Without dead ends: 29 [2022-11-23 01:50:23,947 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-11-23 01:50:23,950 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 01:50:23,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 22 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 01:50:23,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-23 01:50:23,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-23 01:50:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 28 states have internal predecessors, (31), 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-11-23 01:50:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-11-23 01:50:23,961 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 6 [2022-11-23 01:50:23,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:50:23,962 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-11-23 01:50:23,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-23 01:50:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-11-23 01:50:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 01:50:23,963 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:50:23,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 01:50:23,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 01:50:23,964 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 01:50:23,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:50:23,965 INFO L85 PathProgramCache]: Analyzing trace with hash 889508821, now seen corresponding path program 1 times [2022-11-23 01:50:23,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:50:23,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372154189] [2022-11-23 01:50:23,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:50:23,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:50:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:50:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:50:24,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:50:24,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372154189] [2022-11-23 01:50:24,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372154189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:50:24,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:50:24,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 01:50:24,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546929185] [2022-11-23 01:50:24,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:50:24,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:50:24,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:50:24,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:50:24,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:50:24,154 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-11-23 01:50:24,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:50:24,188 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-11-23 01:50:24,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 01:50:24,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2022-11-23 01:50:24,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:50:24,190 INFO L225 Difference]: With dead ends: 46 [2022-11-23 01:50:24,190 INFO L226 Difference]: Without dead ends: 46 [2022-11-23 01:50:24,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-23 01:50:24,192 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 01:50:24,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 44 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 01:50:24,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-23 01:50:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 30. [2022-11-23 01:50:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 29 states have internal predecessors, (32), 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-11-23 01:50:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-11-23 01:50:24,198 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 6 [2022-11-23 01:50:24,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:50:24,198 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-11-23 01:50:24,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-11-23 01:50:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-11-23 01:50:24,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 01:50:24,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:50:24,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 01:50:24,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 01:50:24,201 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 01:50:24,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:50:24,202 INFO L85 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2022-11-23 01:50:24,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:50:24,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406890997] [2022-11-23 01:50:24,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:50:24,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:50:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:50:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:50:24,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:50:24,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406890997] [2022-11-23 01:50:24,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406890997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:50:24,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:50:24,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:50:24,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783650513] [2022-11-23 01:50:24,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:50:24,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:50:24,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:50:24,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:50:24,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:50:24,428 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-11-23 01:50:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:50:24,565 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-11-23 01:50:24,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:50:24,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2022-11-23 01:50:24,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:50:24,568 INFO L225 Difference]: With dead ends: 52 [2022-11-23 01:50:24,570 INFO L226 Difference]: Without dead ends: 52 [2022-11-23 01:50:24,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:50:24,572 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 72 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 01:50:24,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 47 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 01:50:24,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-23 01:50:24,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 32. [2022-11-23 01:50:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 31 states have internal predecessors, (35), 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-11-23 01:50:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-23 01:50:24,577 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 6 [2022-11-23 01:50:24,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:50:24,578 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-23 01:50:24,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-11-23 01:50:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-23 01:50:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 01:50:24,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:50:24,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 01:50:24,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 01:50:24,580 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 01:50:24,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:50:24,581 INFO L85 PathProgramCache]: Analyzing trace with hash 889568403, now seen corresponding path program 1 times [2022-11-23 01:50:24,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:50:24,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551721507] [2022-11-23 01:50:24,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:50:24,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:50:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:50:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:50:24,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:50:24,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551721507] [2022-11-23 01:50:24,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551721507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:50:24,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:50:24,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:50:24,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873634808] [2022-11-23 01:50:24,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:50:24,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:50:24,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:50:24,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:50:24,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:50:24,742 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-11-23 01:50:24,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:50:24,812 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-11-23 01:50:24,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:50:24,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2022-11-23 01:50:24,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:50:24,813 INFO L225 Difference]: With dead ends: 51 [2022-11-23 01:50:24,814 INFO L226 Difference]: Without dead ends: 51 [2022-11-23 01:50:24,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:50:24,816 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 51 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 01:50:24,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 49 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 01:50:24,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-23 01:50:24,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2022-11-23 01:50:24,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 31 states have internal predecessors, (35), 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-11-23 01:50:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-23 01:50:24,822 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 6 [2022-11-23 01:50:24,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:50:24,822 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-23 01:50:24,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-11-23 01:50:24,823 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-23 01:50:24,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 01:50:24,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:50:24,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:50:24,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 01:50:24,824 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 01:50:24,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:50:24,825 INFO L85 PathProgramCache]: Analyzing trace with hash -590959631, now seen corresponding path program 1 times [2022-11-23 01:50:24,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:50:24,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770620813] [2022-11-23 01:50:24,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:50:24,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:50:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:50:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:50:24,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:50:24,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770620813] [2022-11-23 01:50:24,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770620813] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:50:24,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:50:24,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:50:24,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100545546] [2022-11-23 01:50:24,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:50:24,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:50:24,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:50:24,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:50:24,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:50:24,913 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-11-23 01:50:24,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:50:24,986 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-11-23 01:50:24,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:50:24,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2022-11-23 01:50:24,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:50:24,988 INFO L225 Difference]: With dead ends: 31 [2022-11-23 01:50:24,988 INFO L226 Difference]: Without dead ends: 31 [2022-11-23 01:50:24,989 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-11-23 01:50:24,990 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 42 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 01:50:24,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 01:50:24,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-23 01:50:24,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-23 01:50:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 30 states have internal predecessors, (34), 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-11-23 01:50:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-11-23 01:50:24,996 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 9 [2022-11-23 01:50:24,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:50:24,996 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-11-23 01:50:24,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-11-23 01:50:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-11-23 01:50:24,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 01:50:24,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:50:24,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:50:24,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 01:50:24,998 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 01:50:24,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:50:24,999 INFO L85 PathProgramCache]: Analyzing trace with hash -590959630, now seen corresponding path program 1 times [2022-11-23 01:50:25,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:50:25,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268914151] [2022-11-23 01:50:25,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:50:25,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:50:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:50:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:50:25,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:50:25,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268914151] [2022-11-23 01:50:25,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268914151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:50:25,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:50:25,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 01:50:25,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244447398] [2022-11-23 01:50:25,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:50:25,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 01:50:25,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:50:25,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 01:50:25,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-23 01:50:25,211 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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-11-23 01:50:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:50:25,375 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-11-23 01:50:25,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 01:50:25,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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 9 [2022-11-23 01:50:25,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:50:25,376 INFO L225 Difference]: With dead ends: 43 [2022-11-23 01:50:25,376 INFO L226 Difference]: Without dead ends: 43 [2022-11-23 01:50:25,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-23 01:50:25,378 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 140 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 01:50:25,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 39 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 01:50:25,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-23 01:50:25,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2022-11-23 01:50:25,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.4) internal successors, (35), 31 states have internal predecessors, (35), 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-11-23 01:50:25,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-23 01:50:25,383 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 9 [2022-11-23 01:50:25,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:50:25,384 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-23 01:50:25,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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-11-23 01:50:25,385 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-23 01:50:25,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 01:50:25,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:50:25,386 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:50:25,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 01:50:25,386 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 01:50:25,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:50:25,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1900556789, now seen corresponding path program 1 times [2022-11-23 01:50:25,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:50:25,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474864464] [2022-11-23 01:50:25,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:50:25,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:50:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:50:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:50:25,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:50:25,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474864464] [2022-11-23 01:50:25,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474864464] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:50:25,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198385929] [2022-11-23 01:50:25,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:50:25,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:50:25,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:50:25,691 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:50:25,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 01:50:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:50:25,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-23 01:50:25,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:50:25,864 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 8 treesize of output 7 [2022-11-23 01:50:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:50:26,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:50:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:50:26,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198385929] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:50:26,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:50:26,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-11-23 01:50:26,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056997389] [2022-11-23 01:50:26,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:50:26,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 01:50:26,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:50:26,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 01:50:26,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-23 01:50:26,453 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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-11-23 01:50:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:50:26,784 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-11-23 01:50:26,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 01:50:26,785 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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-11-23 01:50:26,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:50:26,786 INFO L225 Difference]: With dead ends: 68 [2022-11-23 01:50:26,786 INFO L226 Difference]: Without dead ends: 68 [2022-11-23 01:50:26,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2022-11-23 01:50:26,788 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 159 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 01:50:26,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 182 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 01:50:26,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-23 01:50:26,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 30. [2022-11-23 01:50:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.375) internal successors, (33), 29 states have internal predecessors, (33), 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-11-23 01:50:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-23 01:50:26,793 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 10 [2022-11-23 01:50:26,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:50:26,794 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-23 01:50:26,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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-11-23 01:50:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-23 01:50:26,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 01:50:26,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:50:26,795 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:50:26,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 01:50:26,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:50:26,996 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 01:50:26,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:50:26,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1900556842, now seen corresponding path program 1 times [2022-11-23 01:50:26,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:50:26,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623495954] [2022-11-23 01:50:26,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:50:26,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:50:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:50:27,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:50:27,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:50:27,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623495954] [2022-11-23 01:50:27,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623495954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:50:27,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419308186] [2022-11-23 01:50:27,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:50:27,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:50:27,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:50:27,235 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:50:27,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 01:50:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:50:27,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 01:50:27,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:50:27,333 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 8 treesize of output 7 [2022-11-23 01:50:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:50:27,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:50:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:50:27,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419308186] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 01:50:27,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 01:50:27,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 12 [2022-11-23 01:50:27,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865134621] [2022-11-23 01:50:27,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:50:27,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:50:27,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:50:27,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:50:27,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-23 01:50:27,622 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-11-23 01:50:27,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:50:27,704 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-11-23 01:50:27,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:50:27,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-11-23 01:50:27,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:50:27,706 INFO L225 Difference]: With dead ends: 29 [2022-11-23 01:50:27,706 INFO L226 Difference]: Without dead ends: 29 [2022-11-23 01:50:27,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-11-23 01:50:27,710 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 58 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 01:50:27,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 18 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 01:50:27,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-23 01:50:27,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-23 01:50:27,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 26 states have internal predecessors, (29), 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-11-23 01:50:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-11-23 01:50:27,728 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 10 [2022-11-23 01:50:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:50:27,729 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-11-23 01:50:27,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-11-23 01:50:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-11-23 01:50:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 01:50:27,731 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:50:27,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:50:27,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-23 01:50:27,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:50:27,937 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 01:50:27,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:50:27,938 INFO L85 PathProgramCache]: Analyzing trace with hash -976521877, now seen corresponding path program 1 times [2022-11-23 01:50:27,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:50:27,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645085044] [2022-11-23 01:50:27,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:50:27,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:50:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:50:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:50:28,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:50:28,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645085044] [2022-11-23 01:50:28,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645085044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:50:28,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:50:28,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 01:50:28,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385151073] [2022-11-23 01:50:28,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:50:28,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 01:50:28,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:50:28,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 01:50:28,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-23 01:50:28,180 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:50:28,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:50:28,301 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-11-23 01:50:28,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 01:50:28,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-23 01:50:28,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:50:28,302 INFO L225 Difference]: With dead ends: 42 [2022-11-23 01:50:28,302 INFO L226 Difference]: Without dead ends: 42 [2022-11-23 01:50:28,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-23 01:50:28,303 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 52 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 01:50:28,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 124 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 01:50:28,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-23 01:50:28,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2022-11-23 01:50:28,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 31 states have internal predecessors, (34), 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-11-23 01:50:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-11-23 01:50:28,307 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 11 [2022-11-23 01:50:28,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:50:28,307 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-11-23 01:50:28,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:50:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-11-23 01:50:28,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 01:50:28,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:50:28,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:50:28,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 01:50:28,309 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 01:50:28,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:50:28,310 INFO L85 PathProgramCache]: Analyzing trace with hash -296463507, now seen corresponding path program 1 times [2022-11-23 01:50:28,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:50:28,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495821207] [2022-11-23 01:50:28,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:50:28,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:50:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:50:28,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:50:28,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:50:28,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495821207] [2022-11-23 01:50:28,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495821207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:50:28,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:50:28,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-23 01:50:28,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000454512] [2022-11-23 01:50:28,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:50:28,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 01:50:28,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:50:28,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 01:50:28,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-23 01:50:28,515 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-23 01:50:28,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:50:28,641 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2022-11-23 01:50:28,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 01:50:28,642 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-23 01:50:28,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:50:28,646 INFO L225 Difference]: With dead ends: 51 [2022-11-23 01:50:28,647 INFO L226 Difference]: Without dead ends: 51 [2022-11-23 01:50:28,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-11-23 01:50:28,648 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 91 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 01:50:28,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 94 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 01:50:28,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-23 01:50:28,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2022-11-23 01:50:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 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-11-23 01:50:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-11-23 01:50:28,656 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 11 [2022-11-23 01:50:28,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:50:28,657 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-11-23 01:50:28,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-23 01:50:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-11-23 01:50:28,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 01:50:28,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:50:28,659 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:50:28,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 01:50:28,659 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 01:50:28,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:50:28,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2134702601, now seen corresponding path program 1 times [2022-11-23 01:50:28,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:50:28,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939375694] [2022-11-23 01:50:28,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:50:28,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:50:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:50:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:50:28,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:50:28,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939375694] [2022-11-23 01:50:28,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939375694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:50:28,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:50:28,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:50:28,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112922054] [2022-11-23 01:50:28,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:50:28,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:50:28,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:50:28,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:50:28,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:50:28,726 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-11-23 01:50:28,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:50:28,755 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-11-23 01:50:28,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:50:28,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-11-23 01:50:28,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:50:28,757 INFO L225 Difference]: With dead ends: 32 [2022-11-23 01:50:28,757 INFO L226 Difference]: Without dead ends: 32 [2022-11-23 01:50:28,757 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-11-23 01:50:28,758 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 01:50:28,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 39 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 01:50:28,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-23 01:50:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-23 01:50:28,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.25) internal successors, (35), 31 states have internal predecessors, (35), 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-11-23 01:50:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-23 01:50:28,766 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 13 [2022-11-23 01:50:28,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:50:28,767 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-23 01:50:28,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-11-23 01:50:28,767 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-23 01:50:28,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 01:50:28,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:50:28,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:50:28,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 01:50:28,770 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 01:50:28,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:50:28,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1751271107, now seen corresponding path program 1 times [2022-11-23 01:50:28,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:50:28,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998685974] [2022-11-23 01:50:28,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:50:28,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:50:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:50:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:50:28,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:50:28,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998685974] [2022-11-23 01:50:28,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998685974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:50:28,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:50:28,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:50:28,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038130650] [2022-11-23 01:50:28,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:50:28,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:50:28,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:50:28,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:50:28,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:50:28,827 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-11-23 01:50:28,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:50:28,865 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-11-23 01:50:28,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:50:28,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2022-11-23 01:50:28,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:50:28,866 INFO L225 Difference]: With dead ends: 31 [2022-11-23 01:50:28,866 INFO L226 Difference]: Without dead ends: 31 [2022-11-23 01:50:28,867 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-11-23 01:50:28,867 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 01:50:28,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 31 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 01:50:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-23 01:50:28,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-23 01:50:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 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-11-23 01:50:28,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-11-23 01:50:28,871 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 14 [2022-11-23 01:50:28,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:50:28,871 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-11-23 01:50:28,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-11-23 01:50:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-11-23 01:50:28,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 01:50:28,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:50:28,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:50:28,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 01:50:28,873 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 01:50:28,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:50:28,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1545170617, now seen corresponding path program 1 times [2022-11-23 01:50:28,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:50:28,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122584652] [2022-11-23 01:50:28,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:50:28,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:50:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:50:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:50:28,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:50:28,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122584652] [2022-11-23 01:50:28,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122584652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:50:28,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:50:28,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 01:50:28,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883397639] [2022-11-23 01:50:28,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:50:28,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:50:28,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:50:28,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:50:28,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:50:28,924 INFO L87 Difference]: Start difference. First operand 31 states and 34 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-11-23 01:50:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:50:28,964 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-11-23 01:50:28,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:50:28,964 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-11-23 01:50:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:50:28,965 INFO L225 Difference]: With dead ends: 30 [2022-11-23 01:50:28,965 INFO L226 Difference]: Without dead ends: 30 [2022-11-23 01:50:28,965 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-11-23 01:50:28,966 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 01:50:28,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 30 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 01:50:28,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-23 01:50:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-23 01:50:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 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-11-23 01:50:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-23 01:50:28,969 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2022-11-23 01:50:28,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:50:28,970 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-23 01:50:28,970 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-11-23 01:50:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-23 01:50:28,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 01:50:28,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:50:28,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:50:28,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 01:50:28,971 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-23 01:50:28,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:50:28,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1218024458, now seen corresponding path program 1 times [2022-11-23 01:50:28,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:50:28,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539569535] [2022-11-23 01:50:28,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:50:28,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:50:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:50:28,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:50:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:50:29,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:50:29,015 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 01:50:29,016 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 10 remaining) [2022-11-23 01:50:29,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2022-11-23 01:50:29,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-23 01:50:29,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-23 01:50:29,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-23 01:50:29,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-23 01:50:29,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (3 of 10 remaining) [2022-11-23 01:50:29,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (2 of 10 remaining) [2022-11-23 01:50:29,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (1 of 10 remaining) [2022-11-23 01:50:29,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-23 01:50:29,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 01:50:29,023 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:50:29,028 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 01:50:29,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:50:29 BoogieIcfgContainer [2022-11-23 01:50:29,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 01:50:29,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 01:50:29,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 01:50:29,056 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 01:50:29,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:22" (3/4) ... [2022-11-23 01:50:29,059 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 01:50:29,120 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 01:50:29,123 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 01:50:29,124 INFO L158 Benchmark]: Toolchain (without parser) took 7354.58ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 164.1MB in the beginning and 203.9MB in the end (delta: -39.8MB). Peak memory consumption was 128.3MB. Max. memory is 16.1GB. [2022-11-23 01:50:29,125 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 115.3MB. Free memory was 71.1MB in the beginning and 70.9MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 01:50:29,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.98ms. Allocated memory is still 195.0MB. Free memory was 163.6MB in the beginning and 147.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-23 01:50:29,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.86ms. Allocated memory is still 195.0MB. Free memory was 147.9MB in the beginning and 146.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 01:50:29,127 INFO L158 Benchmark]: Boogie Preprocessor took 53.09ms. Allocated memory is still 195.0MB. Free memory was 146.2MB in the beginning and 144.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 01:50:29,129 INFO L158 Benchmark]: RCFGBuilder took 496.17ms. Allocated memory is still 195.0MB. Free memory was 144.7MB in the beginning and 132.6MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 01:50:29,129 INFO L158 Benchmark]: TraceAbstraction took 6186.80ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 131.6MB in the beginning and 79.8MB in the end (delta: 51.8MB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. [2022-11-23 01:50:29,130 INFO L158 Benchmark]: Witness Printer took 68.16ms. Allocated memory is still 234.9MB. Free memory was 79.8MB in the beginning and 203.9MB in the end (delta: -124.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 01:50:29,133 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.24ms. Allocated memory is still 115.3MB. Free memory was 71.1MB in the beginning and 70.9MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 480.98ms. Allocated memory is still 195.0MB. Free memory was 163.6MB in the beginning and 147.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.86ms. Allocated memory is still 195.0MB. Free memory was 147.9MB in the beginning and 146.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.09ms. Allocated memory is still 195.0MB. Free memory was 146.2MB in the beginning and 144.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 496.17ms. Allocated memory is still 195.0MB. Free memory was 144.7MB in the beginning and 132.6MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6186.80ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 131.6MB in the beginning and 79.8MB in the end (delta: 51.8MB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. * Witness Printer took 68.16ms. Allocated memory is still 234.9MB. Free memory was 79.8MB in the beginning and 203.9MB in the end (delta: -124.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L537] CALL, EXPR build_nondet_String() [L515] int length = __VERIFIER_nondet_int(); [L516] COND FALSE !(length < 1) VAL [length=2] [L519] char* nondetString = (char*) malloc(length * sizeof(char)); [L521] int i = 0; VAL [i=0, length=2, nondetString={-1:0}] [L521] COND TRUE i < length - 1 [L523] nondetString[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-2, i=0, length=2, nondetString={-1:0}] [L521] i++ VAL [i=1, length=2, nondetString={-1:0}] [L521] COND FALSE !(i < length - 1) VAL [i=1, length=2, nondetString={-1:0}] [L526] nondetString[length-1] = '\0' VAL [i=1, length=2, nondetString={-1:0}] [L527] return nondetString; VAL [\result={-1:0}, i=1, length=2, nondetString={-1:0}] [L537] RET, EXPR build_nondet_String() [L537] char* p = build_nondet_String(); [L538] CALL cstrlen(p) [L531] const char *p = s; VAL [#in~s={-1:0}, p={-1:0}, s={-1:0}] [L532] EXPR \read(*p) VAL [#in~s={-1:0}, \read(*p)=-2, p={-1:0}, s={-1:0}] [L532] COND TRUE *p != '\0' [L533] p = p+2 VAL [#in~s={-1:0}, p={-1:2}, s={-1:0}] [L532] \read(*p) - 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: 539]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 536]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 845 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 845 mSDsluCounter, 826 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 544 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 541 IncrementalHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 282 mSDtfsCounter, 541 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=11, InterpolantAutomatonStates: 78, 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, 153 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 1495 SizeOfPredicates, 2 NumberOfNonLiveVariables, 88 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 4/11 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 proved your program to be incorrect! [2022-11-23 01:50:29,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9399fce8-4182-468e-9dec-f46600ef0ca7/bin/uautomizer-QkZJyEgLgS/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)