./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8 --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 7d18364cf74a7e83a7d0637d6dc5303d99591a287435332871b1650f13e39eb3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 19:33:49,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:33:49,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:33:49,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:33:49,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:33:49,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:33:49,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:33:49,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:33:49,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:33:49,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:33:49,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:33:49,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:33:49,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:33:49,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:33:49,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:33:49,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:33:49,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:33:49,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:33:49,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:33:49,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:33:49,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:33:49,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:33:49,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:33:49,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:33:49,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:33:49,126 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:33:49,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:33:49,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:33:49,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:33:49,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:33:49,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:33:49,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:33:49,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:33:49,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:33:49,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:33:49,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:33:49,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:33:49,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:33:49,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:33:49,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:33:49,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:33:49,135 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 19:33:49,153 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:33:49,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:33:49,154 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:33:49,154 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:33:49,154 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:33:49,155 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:33:49,155 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:33:49,155 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:33:49,156 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:33:49,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:33:49,156 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:33:49,156 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 19:33:49,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:33:49,156 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:33:49,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:33:49,157 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 19:33:49,157 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 19:33:49,157 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 19:33:49,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:33:49,157 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 19:33:49,157 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:33:49,157 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:33:49,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:33:49,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:33:49,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:33:49,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:33:49,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:33:49,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:33:49,159 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:33:49,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:33:49,159 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:33:49,159 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:33:49,159 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:33:49,159 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:33:49,160 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_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/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_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8 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 -> 7d18364cf74a7e83a7d0637d6dc5303d99591a287435332871b1650f13e39eb3 [2022-12-13 19:33:49,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:33:49,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:33:49,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:33:49,384 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:33:49,385 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:33:49,386 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+cfa-reducer.c [2022-12-13 19:33:51,857 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:33:52,046 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:33:52,047 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+cfa-reducer.c [2022-12-13 19:33:52,054 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/data/e588455ee/f1ada3c2c0e344398de930bf50b2d9bf/FLAG562dbe9f7 [2022-12-13 19:33:52,434 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/data/e588455ee/f1ada3c2c0e344398de930bf50b2d9bf [2022-12-13 19:33:52,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:33:52,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:33:52,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:33:52,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:33:52,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:33:52,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:33:52" (1/1) ... [2022-12-13 19:33:52,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43bd14f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:33:52, skipping insertion in model container [2022-12-13 19:33:52,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:33:52" (1/1) ... [2022-12-13 19:33:52,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:33:52,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:33:52,645 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+cfa-reducer.c[7920,7933] [2022-12-13 19:33:52,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:33:52,664 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:33:52,719 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+cfa-reducer.c[7920,7933] [2022-12-13 19:33:52,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:33:52,736 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:33:52,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:33:52 WrapperNode [2022-12-13 19:33:52,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:33:52,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:33:52,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:33:52,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:33:52,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:33:52" (1/1) ... [2022-12-13 19:33:52,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:33:52" (1/1) ... [2022-12-13 19:33:52,786 INFO L138 Inliner]: procedures = 17, calls = 199, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 358 [2022-12-13 19:33:52,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:33:52,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:33:52,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:33:52,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:33:52,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:33:52" (1/1) ... [2022-12-13 19:33:52,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:33:52" (1/1) ... [2022-12-13 19:33:52,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:33:52" (1/1) ... [2022-12-13 19:33:52,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:33:52" (1/1) ... [2022-12-13 19:33:52,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:33:52" (1/1) ... [2022-12-13 19:33:52,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:33:52" (1/1) ... [2022-12-13 19:33:52,822 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:33:52" (1/1) ... [2022-12-13 19:33:52,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:33:52" (1/1) ... [2022-12-13 19:33:52,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:33:52,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:33:52,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:33:52,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:33:52,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:33:52" (1/1) ... [2022-12-13 19:33:52,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:33:52,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:33:52,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:33:52,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:33:52,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 19:33:52,904 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2022-12-13 19:33:52,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:33:52,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:33:52,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 19:33:52,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:33:52,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:33:52,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 19:33:52,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 19:33:53,000 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:33:53,001 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:33:53,440 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:33:53,448 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:33:53,448 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 19:33:53,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:33:53 BoogieIcfgContainer [2022-12-13 19:33:53,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:33:53,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:33:53,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:33:53,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:33:53,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:33:52" (1/3) ... [2022-12-13 19:33:53,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcff23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:33:53, skipping insertion in model container [2022-12-13 19:33:53,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:33:52" (2/3) ... [2022-12-13 19:33:53,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcff23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:33:53, skipping insertion in model container [2022-12-13 19:33:53,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:33:53" (3/3) ... [2022-12-13 19:33:53,460 INFO L112 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+cfa-reducer.c [2022-12-13 19:33:53,476 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:33:53,476 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 86 error locations. [2022-12-13 19:33:53,513 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:33:53,519 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;@5ff3b7ab, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:33:53,519 INFO L358 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2022-12-13 19:33:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 182 states, 95 states have (on average 1.9578947368421054) internal successors, (186), 181 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:53,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-13 19:33:53,527 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:33:53,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-13 19:33:53,528 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-12-13 19:33:53,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:33:53,532 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2022-12-13 19:33:53,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:33:53,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195530516] [2022-12-13 19:33:53,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:33:53,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:33:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:33:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:33:53,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:33:53,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195530516] [2022-12-13 19:33:53,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195530516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:33:53,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:33:53,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:33:53,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688285091] [2022-12-13 19:33:53,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:33:53,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:33:53,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:33:53,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:33:53,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:33:53,757 INFO L87 Difference]: Start difference. First operand has 182 states, 95 states have (on average 1.9578947368421054) internal successors, (186), 181 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:53,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:33:53,917 INFO L93 Difference]: Finished difference Result 183 states and 185 transitions. [2022-12-13 19:33:53,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:33:53,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-13 19:33:53,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:33:53,928 INFO L225 Difference]: With dead ends: 183 [2022-12-13 19:33:53,928 INFO L226 Difference]: Without dead ends: 180 [2022-12-13 19:33:53,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:33:53,933 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 166 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:33:53,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 200 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:33:53,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-12-13 19:33:53,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2022-12-13 19:33:53,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 94 states have (on average 1.925531914893617) internal successors, (181), 179 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2022-12-13 19:33:53,967 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 4 [2022-12-13 19:33:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:33:53,968 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2022-12-13 19:33:53,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2022-12-13 19:33:53,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-13 19:33:53,968 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:33:53,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-13 19:33:53,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 19:33:53,969 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-12-13 19:33:53,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:33:53,970 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-12-13 19:33:53,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:33:53,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377879499] [2022-12-13 19:33:53,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:33:53,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:33:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:33:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:33:54,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:33:54,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377879499] [2022-12-13 19:33:54,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377879499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:33:54,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:33:54,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:33:54,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287697356] [2022-12-13 19:33:54,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:33:54,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:33:54,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:33:54,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:33:54,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:33:54,026 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:54,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:33:54,169 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2022-12-13 19:33:54,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:33:54,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-13 19:33:54,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:33:54,171 INFO L225 Difference]: With dead ends: 139 [2022-12-13 19:33:54,171 INFO L226 Difference]: Without dead ends: 139 [2022-12-13 19:33:54,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:33:54,172 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 269 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:33:54,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 53 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:33:54,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-13 19:33:54,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-12-13 19:33:54,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 138 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:54,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2022-12-13 19:33:54,179 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 4 [2022-12-13 19:33:54,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:33:54,179 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2022-12-13 19:33:54,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2022-12-13 19:33:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-13 19:33:54,180 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:33:54,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-13 19:33:54,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 19:33:54,180 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-12-13 19:33:54,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:33:54,181 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2022-12-13 19:33:54,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:33:54,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917962257] [2022-12-13 19:33:54,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:33:54,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:33:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:33:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:33:54,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:33:54,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917962257] [2022-12-13 19:33:54,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917962257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:33:54,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:33:54,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:33:54,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141839292] [2022-12-13 19:33:54,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:33:54,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:33:54,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:33:54,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:33:54,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:33:54,260 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:33:54,378 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-12-13 19:33:54,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:33:54,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-13 19:33:54,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:33:54,379 INFO L225 Difference]: With dead ends: 98 [2022-12-13 19:33:54,380 INFO L226 Difference]: Without dead ends: 98 [2022-12-13 19:33:54,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:33:54,381 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 189 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:33:54,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 54 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:33:54,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-12-13 19:33:54,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-12-13 19:33:54,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.053191489361702) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:54,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2022-12-13 19:33:54,387 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 4 [2022-12-13 19:33:54,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:33:54,387 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-12-13 19:33:54,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:54,388 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2022-12-13 19:33:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 19:33:54,390 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:33:54,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:33:54,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 19:33:54,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-12-13 19:33:54,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:33:54,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1325804059, now seen corresponding path program 1 times [2022-12-13 19:33:54,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:33:54,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411514280] [2022-12-13 19:33:54,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:33:54,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:33:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:33:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:33:54,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:33:54,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411514280] [2022-12-13 19:33:54,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411514280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:33:54,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:33:54,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:33:54,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079246111] [2022-12-13 19:33:54,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:33:54,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:33:54,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:33:54,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:33:54,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:33:54,662 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:54,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:33:54,683 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2022-12-13 19:33:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:33:54,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 91 [2022-12-13 19:33:54,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:33:54,685 INFO L225 Difference]: With dead ends: 111 [2022-12-13 19:33:54,685 INFO L226 Difference]: Without dead ends: 111 [2022-12-13 19:33:54,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:33:54,686 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 19 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:33:54,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 291 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:33:54,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-12-13 19:33:54,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2022-12-13 19:33:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 99 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2022-12-13 19:33:54,693 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 91 [2022-12-13 19:33:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:33:54,694 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2022-12-13 19:33:54,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-12-13 19:33:54,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 19:33:54,696 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:33:54,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:33:54,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 19:33:54,697 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-12-13 19:33:54,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:33:54,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1325803930, now seen corresponding path program 1 times [2022-12-13 19:33:54,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:33:54,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379555952] [2022-12-13 19:33:54,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:33:54,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:33:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:33:54,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-12-13 19:33:54,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:33:54,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379555952] [2022-12-13 19:33:54,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379555952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:33:54,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:33:54,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:33:54,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120967183] [2022-12-13 19:33:54,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:33:54,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:33:54,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:33:54,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:33:54,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:33:54,923 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:55,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:33:55,009 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-12-13 19:33:55,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:33:55,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 4 states have internal predecessors, (91), 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 91 [2022-12-13 19:33:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:33:55,010 INFO L225 Difference]: With dead ends: 100 [2022-12-13 19:33:55,010 INFO L226 Difference]: Without dead ends: 100 [2022-12-13 19:33:55,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:33:55,011 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 10 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:33:55,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 183 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:33:55,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-12-13 19:33:55,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2022-12-13 19:33:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 98 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:55,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2022-12-13 19:33:55,017 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 91 [2022-12-13 19:33:55,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:33:55,017 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2022-12-13 19:33:55,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.333333333333332) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:55,017 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-12-13 19:33:55,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 19:33:55,019 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:33:55,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:33:55,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 19:33:55,020 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-12-13 19:33:55,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:33:55,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1325803929, now seen corresponding path program 1 times [2022-12-13 19:33:55,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:33:55,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106458458] [2022-12-13 19:33:55,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:33:55,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:33:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:33:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:33:55,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:33:55,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106458458] [2022-12-13 19:33:55,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106458458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:33:55,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:33:55,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:33:55,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427128588] [2022-12-13 19:33:55,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:33:55,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:33:55,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:33:55,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:33:55,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:33:55,396 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:55,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:33:55,567 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-12-13 19:33:55,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:33:55,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 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 91 [2022-12-13 19:33:55,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:33:55,568 INFO L225 Difference]: With dead ends: 104 [2022-12-13 19:33:55,568 INFO L226 Difference]: Without dead ends: 104 [2022-12-13 19:33:55,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:33:55,569 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 20 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:33:55,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 233 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:33:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-12-13 19:33:55,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-12-13 19:33:55,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 97 states have (on average 1.041237113402062) internal successors, (101), 99 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2022-12-13 19:33:55,574 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 91 [2022-12-13 19:33:55,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:33:55,575 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2022-12-13 19:33:55,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:55,575 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-12-13 19:33:55,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 19:33:55,576 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:33:55,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:33:55,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 19:33:55,577 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-12-13 19:33:55,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:33:55,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1325238030, now seen corresponding path program 1 times [2022-12-13 19:33:55,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:33:55,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766695748] [2022-12-13 19:33:55,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:33:55,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:33:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:33:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:33:55,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:33:55,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766695748] [2022-12-13 19:33:55,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766695748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:33:55,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:33:55,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:33:55,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490431898] [2022-12-13 19:33:55,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:33:55,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:33:55,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:33:55,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:33:55,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:33:55,722 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:55,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:33:55,739 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-12-13 19:33:55,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:33:55,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 91 [2022-12-13 19:33:55,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:33:55,741 INFO L225 Difference]: With dead ends: 110 [2022-12-13 19:33:55,741 INFO L226 Difference]: Without dead ends: 110 [2022-12-13 19:33:55,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:33:55,742 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 99 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:33:55,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 197 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:33:55,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-12-13 19:33:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2022-12-13 19:33:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 100 states have (on average 1.04) internal successors, (104), 102 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2022-12-13 19:33:55,746 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 91 [2022-12-13 19:33:55,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:33:55,746 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2022-12-13 19:33:55,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2022-12-13 19:33:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-13 19:33:55,747 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:33:55,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:33:55,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 19:33:55,747 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-12-13 19:33:55,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:33:55,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1507715499, now seen corresponding path program 1 times [2022-12-13 19:33:55,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:33:55,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267909591] [2022-12-13 19:33:55,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:33:55,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:33:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:33:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:33:56,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:33:56,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267909591] [2022-12-13 19:33:56,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267909591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:33:56,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:33:56,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 19:33:56,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555753705] [2022-12-13 19:33:56,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:33:56,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 19:33:56,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:33:56,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 19:33:56,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-13 19:33:56,345 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand has 10 states, 9 states have (on average 10.333333333333334) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:56,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:33:56,489 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2022-12-13 19:33:56,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:33:56,489 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.333333333333334) internal successors, (93), 10 states have internal predecessors, (93), 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 93 [2022-12-13 19:33:56,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:33:56,490 INFO L225 Difference]: With dead ends: 102 [2022-12-13 19:33:56,490 INFO L226 Difference]: Without dead ends: 101 [2022-12-13 19:33:56,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-13 19:33:56,490 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 10 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:33:56,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 229 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:33:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-12-13 19:33:56,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-12-13 19:33:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 100 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2022-12-13 19:33:56,493 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 93 [2022-12-13 19:33:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:33:56,493 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2022-12-13 19:33:56,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.333333333333334) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:56,494 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-12-13 19:33:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-13 19:33:56,494 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:33:56,494 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:33:56,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 19:33:56,495 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-12-13 19:33:56,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:33:56,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1945915728, now seen corresponding path program 1 times [2022-12-13 19:33:56,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:33:56,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726138750] [2022-12-13 19:33:56,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:33:56,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:33:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:33:56,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:33:56,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:33:56,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726138750] [2022-12-13 19:33:56,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726138750] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:33:56,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243515726] [2022-12-13 19:33:56,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:33:56,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:33:56,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:33:56,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:33:56,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 19:33:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:33:56,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 19:33:56,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:33:56,933 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:33:56,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:33:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:33:56,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243515726] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:33:56,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:33:56,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 19:33:56,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947101441] [2022-12-13 19:33:56,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:33:56,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 19:33:56,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:33:56,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 19:33:56,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 19:33:56,981 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:57,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:33:57,085 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2022-12-13 19:33:57,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 19:33:57,086 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 98 [2022-12-13 19:33:57,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:33:57,086 INFO L225 Difference]: With dead ends: 128 [2022-12-13 19:33:57,086 INFO L226 Difference]: Without dead ends: 128 [2022-12-13 19:33:57,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-12-13 19:33:57,087 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 231 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:33:57,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 379 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:33:57,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-12-13 19:33:57,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2022-12-13 19:33:57,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 120 states have (on average 1.025) internal successors, (123), 121 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2022-12-13 19:33:57,092 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 98 [2022-12-13 19:33:57,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:33:57,092 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2022-12-13 19:33:57,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:57,092 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2022-12-13 19:33:57,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-13 19:33:57,094 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:33:57,094 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:33:57,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 19:33:57,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:33:57,295 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-12-13 19:33:57,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:33:57,295 INFO L85 PathProgramCache]: Analyzing trace with hash 840334706, now seen corresponding path program 2 times [2022-12-13 19:33:57,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:33:57,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676132212] [2022-12-13 19:33:57,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:33:57,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:33:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:33:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:33:57,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:33:57,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676132212] [2022-12-13 19:33:57,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676132212] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:33:57,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477559630] [2022-12-13 19:33:57,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:33:57,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:33:57,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:33:57,668 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:33:57,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 19:33:58,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:33:58,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:33:58,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 19:33:58,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:33:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:33:58,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:33:58,242 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:33:58,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477559630] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:33:58,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:33:58,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-12-13 19:33:58,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670837292] [2022-12-13 19:33:58,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:33:58,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 19:33:58,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:33:58,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 19:33:58,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-12-13 19:33:58,244 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 15 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:33:58,788 INFO L93 Difference]: Finished difference Result 170 states and 171 transitions. [2022-12-13 19:33:58,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 19:33:58,789 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 15 states have internal predecessors, (154), 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 119 [2022-12-13 19:33:58,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:33:58,790 INFO L225 Difference]: With dead ends: 170 [2022-12-13 19:33:58,790 INFO L226 Difference]: Without dead ends: 170 [2022-12-13 19:33:58,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=499, Unknown=0, NotChecked=0, Total=702 [2022-12-13 19:33:58,792 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 179 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:33:58,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 724 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 19:33:58,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-12-13 19:33:58,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 164. [2022-12-13 19:33:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 1.0185185185185186) internal successors, (165), 163 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:58,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 165 transitions. [2022-12-13 19:33:58,797 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 165 transitions. Word has length 119 [2022-12-13 19:33:58,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:33:58,797 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 165 transitions. [2022-12-13 19:33:58,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 15 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:33:58,798 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 165 transitions. [2022-12-13 19:33:58,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 19:33:58,800 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:33:58,801 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:33:58,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 19:33:59,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 19:33:59,001 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-12-13 19:33:59,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:33:59,002 INFO L85 PathProgramCache]: Analyzing trace with hash 828800050, now seen corresponding path program 3 times [2022-12-13 19:33:59,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:33:59,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499835415] [2022-12-13 19:33:59,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:33:59,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:33:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:33:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 20 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:33:59,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:33:59,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499835415] [2022-12-13 19:33:59,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499835415] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:33:59,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102415611] [2022-12-13 19:33:59,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 19:33:59,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:33:59,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:33:59,520 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:33:59,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 19:33:59,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 19:33:59,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:33:59,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 19:33:59,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:34:00,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:34:00,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 19 [2022-12-13 19:34:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 56 proven. 48 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-12-13 19:34:00,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:34:02,138 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 20 proven. 84 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-12-13 19:34:02,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102415611] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:34:02,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:34:02,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2022-12-13 19:34:02,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664735644] [2022-12-13 19:34:02,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:34:02,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 19:34:02,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:34:02,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 19:34:02,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2022-12-13 19:34:02,141 INFO L87 Difference]: Start difference. First operand 164 states and 165 transitions. Second operand has 28 states, 28 states have (on average 7.035714285714286) internal successors, (197), 28 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:34:03,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:34:03,833 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2022-12-13 19:34:03,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-13 19:34:03,834 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.035714285714286) internal successors, (197), 28 states have internal predecessors, (197), 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 161 [2022-12-13 19:34:03,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:34:03,834 INFO L225 Difference]: With dead ends: 175 [2022-12-13 19:34:03,834 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 19:34:03,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=930, Invalid=3492, Unknown=0, NotChecked=0, Total=4422 [2022-12-13 19:34:03,835 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 295 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 19:34:03,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1336 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 19:34:03,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 19:34:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 19:34:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:34:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 19:34:03,836 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2022-12-13 19:34:03,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:34:03,836 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 19:34:03,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.035714285714286) internal successors, (197), 28 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:34:03,836 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 19:34:03,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 19:34:03,838 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 86 remaining) [2022-12-13 19:34:03,838 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 86 remaining) [2022-12-13 19:34:03,839 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 86 remaining) [2022-12-13 19:34:03,839 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 86 remaining) [2022-12-13 19:34:03,839 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 86 remaining) [2022-12-13 19:34:03,839 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 86 remaining) [2022-12-13 19:34:03,839 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 86 remaining) [2022-12-13 19:34:03,839 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 86 remaining) [2022-12-13 19:34:03,839 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 86 remaining) [2022-12-13 19:34:03,839 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 86 remaining) [2022-12-13 19:34:03,839 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 86 remaining) [2022-12-13 19:34:03,839 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 86 remaining) [2022-12-13 19:34:03,839 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 86 remaining) [2022-12-13 19:34:03,839 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 86 remaining) [2022-12-13 19:34:03,839 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 86 remaining) [2022-12-13 19:34:03,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 86 remaining) [2022-12-13 19:34:03,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 86 remaining) [2022-12-13 19:34:03,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 86 remaining) [2022-12-13 19:34:03,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 86 remaining) [2022-12-13 19:34:03,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 86 remaining) [2022-12-13 19:34:03,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 86 remaining) [2022-12-13 19:34:03,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 86 remaining) [2022-12-13 19:34:03,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 86 remaining) [2022-12-13 19:34:03,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 86 remaining) [2022-12-13 19:34:03,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 86 remaining) [2022-12-13 19:34:03,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 86 remaining) [2022-12-13 19:34:03,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 86 remaining) [2022-12-13 19:34:03,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 86 remaining) [2022-12-13 19:34:03,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 86 remaining) [2022-12-13 19:34:03,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 86 remaining) [2022-12-13 19:34:03,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 86 remaining) [2022-12-13 19:34:03,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 86 remaining) [2022-12-13 19:34:03,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 86 remaining) [2022-12-13 19:34:03,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 86 remaining) [2022-12-13 19:34:03,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 86 remaining) [2022-12-13 19:34:03,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 86 remaining) [2022-12-13 19:34:03,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 86 remaining) [2022-12-13 19:34:03,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 86 remaining) [2022-12-13 19:34:03,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 86 remaining) [2022-12-13 19:34:03,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 86 remaining) [2022-12-13 19:34:03,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 86 remaining) [2022-12-13 19:34:03,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 86 remaining) [2022-12-13 19:34:03,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 86 remaining) [2022-12-13 19:34:03,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 86 remaining) [2022-12-13 19:34:03,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 86 remaining) [2022-12-13 19:34:03,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 86 remaining) [2022-12-13 19:34:03,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 86 remaining) [2022-12-13 19:34:03,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 86 remaining) [2022-12-13 19:34:03,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 86 remaining) [2022-12-13 19:34:03,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 86 remaining) [2022-12-13 19:34:03,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 86 remaining) [2022-12-13 19:34:03,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 86 remaining) [2022-12-13 19:34:03,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 86 remaining) [2022-12-13 19:34:03,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 86 remaining) [2022-12-13 19:34:03,842 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 86 remaining) [2022-12-13 19:34:03,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 86 remaining) [2022-12-13 19:34:03,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 86 remaining) [2022-12-13 19:34:03,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 86 remaining) [2022-12-13 19:34:03,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 86 remaining) [2022-12-13 19:34:03,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 86 remaining) [2022-12-13 19:34:03,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 86 remaining) [2022-12-13 19:34:03,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 86 remaining) [2022-12-13 19:34:03,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 86 remaining) [2022-12-13 19:34:03,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 86 remaining) [2022-12-13 19:34:03,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 86 remaining) [2022-12-13 19:34:03,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 86 remaining) [2022-12-13 19:34:03,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 86 remaining) [2022-12-13 19:34:03,843 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 86 remaining) [2022-12-13 19:34:03,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 86 remaining) [2022-12-13 19:34:03,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 86 remaining) [2022-12-13 19:34:03,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 86 remaining) [2022-12-13 19:34:03,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 86 remaining) [2022-12-13 19:34:03,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 86 remaining) [2022-12-13 19:34:03,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 86 remaining) [2022-12-13 19:34:03,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 86 remaining) [2022-12-13 19:34:03,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 86 remaining) [2022-12-13 19:34:03,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 86 remaining) [2022-12-13 19:34:03,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 86 remaining) [2022-12-13 19:34:03,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 86 remaining) [2022-12-13 19:34:03,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 86 remaining) [2022-12-13 19:34:03,844 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 86 remaining) [2022-12-13 19:34:03,845 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 86 remaining) [2022-12-13 19:34:03,845 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK (3 of 86 remaining) [2022-12-13 19:34:03,845 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 86 remaining) [2022-12-13 19:34:03,845 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 86 remaining) [2022-12-13 19:34:03,845 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK (0 of 86 remaining) [2022-12-13 19:34:03,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 19:34:04,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:34:04,054 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:34:04,061 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 19:34:04,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:34:04 BoogieIcfgContainer [2022-12-13 19:34:04,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 19:34:04,071 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 19:34:04,071 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 19:34:04,072 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 19:34:04,073 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:33:53" (3/4) ... [2022-12-13 19:34:04,079 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 19:34:04,095 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-12-13 19:34:04,097 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-12-13 19:34:04,098 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-12-13 19:34:04,099 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 19:34:04,101 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 19:34:04,173 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 19:34:04,173 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 19:34:04,174 INFO L158 Benchmark]: Toolchain (without parser) took 11736.20ms. Allocated memory was 153.1MB in the beginning and 268.4MB in the end (delta: 115.3MB). Free memory was 115.6MB in the beginning and 178.3MB in the end (delta: -62.7MB). Peak memory consumption was 54.3MB. Max. memory is 16.1GB. [2022-12-13 19:34:04,174 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 153.1MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:34:04,174 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.83ms. Allocated memory is still 153.1MB. Free memory was 115.2MB in the beginning and 98.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 19:34:04,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.02ms. Allocated memory is still 153.1MB. Free memory was 98.6MB in the beginning and 95.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 19:34:04,175 INFO L158 Benchmark]: Boogie Preprocessor took 40.37ms. Allocated memory is still 153.1MB. Free memory was 95.4MB in the beginning and 92.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 19:34:04,175 INFO L158 Benchmark]: RCFGBuilder took 623.11ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 92.3MB in the beginning and 151.8MB in the end (delta: -59.5MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. [2022-12-13 19:34:04,175 INFO L158 Benchmark]: TraceAbstraction took 10616.06ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 150.9MB in the beginning and 191.3MB in the end (delta: -40.5MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2022-12-13 19:34:04,176 INFO L158 Benchmark]: Witness Printer took 102.04ms. Allocated memory is still 268.4MB. Free memory was 191.3MB in the beginning and 178.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 19:34:04,178 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.17ms. Allocated memory is still 153.1MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.83ms. Allocated memory is still 153.1MB. Free memory was 115.2MB in the beginning and 98.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.02ms. Allocated memory is still 153.1MB. Free memory was 98.6MB in the beginning and 95.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.37ms. Allocated memory is still 153.1MB. Free memory was 95.4MB in the beginning and 92.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 623.11ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 92.3MB in the beginning and 151.8MB in the end (delta: -59.5MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10616.06ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 150.9MB in the beginning and 191.3MB in the end (delta: -40.5MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. * Witness Printer took 102.04ms. Allocated memory is still 268.4MB. Free memory was 191.3MB in the beginning and 178.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 193]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 130]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 182 locations, 86 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 11, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1487 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1487 mSDsluCounter, 3879 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2933 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1717 IncrementalHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 946 mSDtfsCounter, 1717 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 875 GetRequests, 740 SyntacticMatches, 2 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=0, InterpolantAutomatonStates: 106, 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, 11 MinimizatonAttempts, 35 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1225 NumberOfCodeBlocks, 1169 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1586 ConstructedInterpolants, 64 QuantifiedInterpolants, 7368 SizeOfPredicates, 14 NumberOfNonLiveVariables, 2996 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 648/1296 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 - AllSpecificationsHoldResult: All specifications hold 86 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 19:34:04,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f09be04-911e-4c3e-85c2-6e684971f366/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE