./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b 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_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro --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 eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 --- 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-8393723 [2022-11-18 20:20:52,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:20:52,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:20:53,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:20:53,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:20:53,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:20:53,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:20:53,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:20:53,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:20:53,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:20:53,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:20:53,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:20:53,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:20:53,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:20:53,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:20:53,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:20:53,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:20:53,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:20:53,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:20:53,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:20:53,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:20:53,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:20:53,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:20:53,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:20:53,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:20:53,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:20:53,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:20:53,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:20:53,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:20:53,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:20:53,071 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:20:53,072 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:20:53,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:20:53,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:20:53,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:20:53,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:20:53,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:20:53,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:20:53,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:20:53,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:20:53,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:20:53,087 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 20:20:53,126 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:20:53,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:20:53,127 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:20:53,127 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:20:53,128 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:20:53,128 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:20:53,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:20:53,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:20:53,129 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:20:53,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:20:53,130 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:20:53,131 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:20:53,131 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:20:53,131 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:20:53,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:20:53,131 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:20:53,131 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:20:53,132 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:20:53,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:20:53,132 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:20:53,132 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:20:53,132 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:20:53,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:20:53,133 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:20:53,133 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:20:53,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:20:53,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:20:53,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:20:53,134 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:20:53,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:20:53,134 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/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_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro 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 -> eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 [2022-11-18 20:20:53,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:20:53,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:20:53,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:20:53,434 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:20:53,435 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:20:53,436 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2022-11-18 20:20:53,530 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/data/e76c63f6e/7d0bd2899b8246a4bb377875d7834648/FLAG3ff79b89e [2022-11-18 20:20:54,143 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:20:54,144 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2022-11-18 20:20:54,164 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/data/e76c63f6e/7d0bd2899b8246a4bb377875d7834648/FLAG3ff79b89e [2022-11-18 20:20:54,439 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/data/e76c63f6e/7d0bd2899b8246a4bb377875d7834648 [2022-11-18 20:20:54,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:20:54,443 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:20:54,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:20:54,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:20:54,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:20:54,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:20:54" (1/1) ... [2022-11-18 20:20:54,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37cb4fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:54, skipping insertion in model container [2022-11-18 20:20:54,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:20:54" (1/1) ... [2022-11-18 20:20:54,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:20:54,508 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:20:54,727 WARN L234 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_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i[969,982] [2022-11-18 20:20:55,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:20:55,018 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:20:55,031 WARN L234 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_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i[969,982] [2022-11-18 20:20:55,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:20:55,134 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:20:55,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:55 WrapperNode [2022-11-18 20:20:55,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:20:55,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:20:55,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:20:55,138 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:20:55,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:55" (1/1) ... [2022-11-18 20:20:55,183 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:55" (1/1) ... [2022-11-18 20:20:55,231 INFO L138 Inliner]: procedures = 175, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2022-11-18 20:20:55,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:20:55,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:20:55,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:20:55,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:20:55,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:55" (1/1) ... [2022-11-18 20:20:55,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:55" (1/1) ... [2022-11-18 20:20:55,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:55" (1/1) ... [2022-11-18 20:20:55,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:55" (1/1) ... [2022-11-18 20:20:55,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:55" (1/1) ... [2022-11-18 20:20:55,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:55" (1/1) ... [2022-11-18 20:20:55,293 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:55" (1/1) ... [2022-11-18 20:20:55,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:55" (1/1) ... [2022-11-18 20:20:55,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:20:55,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:20:55,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:20:55,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:20:55,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:55" (1/1) ... [2022-11-18 20:20:55,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:20:55,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:20:55,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:20:55,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:20:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:20:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:20:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 20:20:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:20:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:20:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:20:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 20:20:55,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 20:20:55,414 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 20:20:55,414 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 20:20:55,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:20:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 20:20:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:20:55,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:20:55,417 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:20:55,640 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:20:55,642 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:20:56,156 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:20:57,019 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:20:57,020 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:20:57,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:20:57 BoogieIcfgContainer [2022-11-18 20:20:57,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:20:57,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:20:57,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:20:57,031 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:20:57,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:20:54" (1/3) ... [2022-11-18 20:20:57,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695cc8c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:20:57, skipping insertion in model container [2022-11-18 20:20:57,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:20:55" (2/3) ... [2022-11-18 20:20:57,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695cc8c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:20:57, skipping insertion in model container [2022-11-18 20:20:57,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:20:57" (3/3) ... [2022-11-18 20:20:57,041 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2022-11-18 20:20:57,061 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:20:57,061 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2022-11-18 20:20:57,062 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:20:57,191 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 20:20:57,224 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 20:20:57,238 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 150 transitions, 310 flow [2022-11-18 20:20:57,241 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 150 transitions, 310 flow [2022-11-18 20:20:57,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 150 transitions, 310 flow [2022-11-18 20:20:57,365 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-11-18 20:20:57,365 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:20:57,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 198 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-18 20:20:57,377 INFO L119 LiptonReduction]: Number of co-enabled transitions 3984 [2022-11-18 20:21:19,068 INFO L134 LiptonReduction]: Checked pairs total: 16834 [2022-11-18 20:21:19,069 INFO L136 LiptonReduction]: Total number of compositions: 137 [2022-11-18 20:21:19,077 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 64 places, 57 transitions, 124 flow [2022-11-18 20:21:19,223 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3550 states, 2403 states have (on average 4.09779442363712) internal successors, (9847), 3549 states have internal predecessors, (9847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:19,260 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:21:19,267 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5fbafea6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:21:19,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-11-18 20:21:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 3550 states, 2403 states have (on average 4.09779442363712) internal successors, (9847), 3549 states have internal predecessors, (9847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 20:21:19,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:19,281 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 20:21:19,282 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:21:19,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:19,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1007, now seen corresponding path program 1 times [2022-11-18 20:21:19,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:19,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718915657] [2022-11-18 20:21:19,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:19,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:19,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:19,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718915657] [2022-11-18 20:21:19,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718915657] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:21:19,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:21:19,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 20:21:19,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834013963] [2022-11-18 20:21:19,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:21:19,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:21:19,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:19,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:21:19,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:21:19,453 INFO L87 Difference]: Start difference. First operand has 3550 states, 2403 states have (on average 4.09779442363712) internal successors, (9847), 3549 states have internal predecessors, (9847), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:19,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:19,607 INFO L93 Difference]: Finished difference Result 1568 states and 4263 transitions. [2022-11-18 20:21:19,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:21:19,610 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-11-18 20:21:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:19,641 INFO L225 Difference]: With dead ends: 1568 [2022-11-18 20:21:19,641 INFO L226 Difference]: Without dead ends: 1568 [2022-11-18 20:21:19,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:21:19,648 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:19,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:21:19,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2022-11-18 20:21:19,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2022-11-18 20:21:19,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1191 states have (on average 3.579345088161209) internal successors, (4263), 1567 states have internal predecessors, (4263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 4263 transitions. [2022-11-18 20:21:19,784 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 4263 transitions. Word has length 1 [2022-11-18 20:21:19,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:19,785 INFO L495 AbstractCegarLoop]: Abstraction has 1568 states and 4263 transitions. [2022-11-18 20:21:19,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:19,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 4263 transitions. [2022-11-18 20:21:19,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-18 20:21:19,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:19,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-18 20:21:19,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:21:19,787 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:21:19,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:19,788 INFO L85 PathProgramCache]: Analyzing trace with hash 30774871, now seen corresponding path program 1 times [2022-11-18 20:21:19,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:19,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445654842] [2022-11-18 20:21:19,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:19,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:20,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:20,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445654842] [2022-11-18 20:21:20,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445654842] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:21:20,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:21:20,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:21:20,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346080597] [2022-11-18 20:21:20,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:21:20,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:21:20,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:20,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:21:20,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:21:20,111 INFO L87 Difference]: Start difference. First operand 1568 states and 4263 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-11-18 20:21:20,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:20,311 INFO L93 Difference]: Finished difference Result 1411 states and 3820 transitions. [2022-11-18 20:21:20,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:21:20,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-11-18 20:21:20,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:20,328 INFO L225 Difference]: With dead ends: 1411 [2022-11-18 20:21:20,329 INFO L226 Difference]: Without dead ends: 1411 [2022-11-18 20:21:20,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:21:20,336 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:20,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:21:20,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-11-18 20:21:20,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1411. [2022-11-18 20:21:20,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1097 states have (on average 3.4822242479489516) internal successors, (3820), 1410 states have internal predecessors, (3820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:20,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 3820 transitions. [2022-11-18 20:21:20,395 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 3820 transitions. Word has length 4 [2022-11-18 20:21:20,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:20,395 INFO L495 AbstractCegarLoop]: Abstraction has 1411 states and 3820 transitions. [2022-11-18 20:21:20,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-11-18 20:21:20,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 3820 transitions. [2022-11-18 20:21:20,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:21:20,396 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:20,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:21:20,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:21:20,397 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:21:20,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:20,398 INFO L85 PathProgramCache]: Analyzing trace with hash 954021833, now seen corresponding path program 1 times [2022-11-18 20:21:20,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:20,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358824345] [2022-11-18 20:21:20,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:20,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:20,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:20,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358824345] [2022-11-18 20:21:20,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358824345] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:21:20,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:21:20,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:21:20,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275353670] [2022-11-18 20:21:20,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:21:20,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:21:20,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:20,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:21:20,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:21:20,595 INFO L87 Difference]: Start difference. First operand 1411 states and 3820 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:20,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:20,831 INFO L93 Difference]: Finished difference Result 1777 states and 4817 transitions. [2022-11-18 20:21:20,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:21:20,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-18 20:21:20,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:20,861 INFO L225 Difference]: With dead ends: 1777 [2022-11-18 20:21:20,861 INFO L226 Difference]: Without dead ends: 1777 [2022-11-18 20:21:20,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:21:20,863 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:20,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 6 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:21:20,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2022-11-18 20:21:20,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1505. [2022-11-18 20:21:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1207 states have (on average 3.591549295774648) internal successors, (4335), 1504 states have internal predecessors, (4335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:20,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 4335 transitions. [2022-11-18 20:21:20,939 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 4335 transitions. Word has length 5 [2022-11-18 20:21:20,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:20,940 INFO L495 AbstractCegarLoop]: Abstraction has 1505 states and 4335 transitions. [2022-11-18 20:21:20,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:20,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 4335 transitions. [2022-11-18 20:21:20,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:21:20,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:20,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:21:20,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:21:20,943 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:21:20,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:20,944 INFO L85 PathProgramCache]: Analyzing trace with hash 954021835, now seen corresponding path program 1 times [2022-11-18 20:21:20,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:20,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109111140] [2022-11-18 20:21:20,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:20,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:21,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:21,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:21,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109111140] [2022-11-18 20:21:21,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109111140] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:21:21,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:21:21,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:21:21,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784355596] [2022-11-18 20:21:21,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:21:21,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:21:21,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:21,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:21:21,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:21:21,304 INFO L87 Difference]: Start difference. First operand 1505 states and 4335 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:21,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:21,506 INFO L93 Difference]: Finished difference Result 906 states and 2496 transitions. [2022-11-18 20:21:21,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:21:21,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-18 20:21:21,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:21,513 INFO L225 Difference]: With dead ends: 906 [2022-11-18 20:21:21,513 INFO L226 Difference]: Without dead ends: 906 [2022-11-18 20:21:21,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:21:21,514 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 56 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:21,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 3 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:21:21,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-11-18 20:21:21,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 906. [2022-11-18 20:21:21,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 779 states have (on average 3.20410783055199) internal successors, (2496), 905 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 2496 transitions. [2022-11-18 20:21:21,571 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 2496 transitions. Word has length 5 [2022-11-18 20:21:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:21,571 INFO L495 AbstractCegarLoop]: Abstraction has 906 states and 2496 transitions. [2022-11-18 20:21:21,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:21,572 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 2496 transitions. [2022-11-18 20:21:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:21:21,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:21,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:21:21,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:21:21,573 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:21:21,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:21,573 INFO L85 PathProgramCache]: Analyzing trace with hash 954021836, now seen corresponding path program 1 times [2022-11-18 20:21:21,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:21,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236559514] [2022-11-18 20:21:21,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:21,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:21,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:21,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236559514] [2022-11-18 20:21:21,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236559514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:21:21,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:21:21,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:21:21,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486823509] [2022-11-18 20:21:21,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:21:21,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:21:21,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:21,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:21:21,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:21:21,810 INFO L87 Difference]: Start difference. First operand 906 states and 2496 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:21,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:21,957 INFO L93 Difference]: Finished difference Result 413 states and 1048 transitions. [2022-11-18 20:21:21,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:21:21,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-18 20:21:21,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:21,961 INFO L225 Difference]: With dead ends: 413 [2022-11-18 20:21:21,961 INFO L226 Difference]: Without dead ends: 413 [2022-11-18 20:21:21,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:21:21,962 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 59 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:21,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 2 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:21:21,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-18 20:21:21,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 390. [2022-11-18 20:21:21,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 364 states have (on average 2.7225274725274726) internal successors, (991), 389 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 991 transitions. [2022-11-18 20:21:21,975 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 991 transitions. Word has length 5 [2022-11-18 20:21:21,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:21,975 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 991 transitions. [2022-11-18 20:21:21,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:21,976 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 991 transitions. [2022-11-18 20:21:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-18 20:21:21,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:21,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:21:21,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:21:21,977 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:21:21,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:21,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2026098042, now seen corresponding path program 1 times [2022-11-18 20:21:21,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:21,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922464176] [2022-11-18 20:21:21,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:21,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:22,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:22,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922464176] [2022-11-18 20:21:22,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922464176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:21:22,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:21:22,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:21:22,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215989416] [2022-11-18 20:21:22,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:21:22,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:21:22,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:22,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:21:22,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:21:22,060 INFO L87 Difference]: Start difference. First operand 390 states and 991 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:22,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:22,153 INFO L93 Difference]: Finished difference Result 380 states and 963 transitions. [2022-11-18 20:21:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:21:22,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-11-18 20:21:22,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:22,156 INFO L225 Difference]: With dead ends: 380 [2022-11-18 20:21:22,156 INFO L226 Difference]: Without dead ends: 380 [2022-11-18 20:21:22,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:21:22,157 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:22,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:21:22,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-18 20:21:22,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-11-18 20:21:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 354 states have (on average 2.7203389830508473) internal successors, (963), 379 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 963 transitions. [2022-11-18 20:21:22,169 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 963 transitions. Word has length 7 [2022-11-18 20:21:22,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:22,169 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 963 transitions. [2022-11-18 20:21:22,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 963 transitions. [2022-11-18 20:21:22,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-18 20:21:22,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:22,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:21:22,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:21:22,171 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:21:22,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:22,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1615516674, now seen corresponding path program 1 times [2022-11-18 20:21:22,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:22,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914373637] [2022-11-18 20:21:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:22,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:22,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914373637] [2022-11-18 20:21:22,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914373637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:21:22,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:21:22,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:21:22,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146743009] [2022-11-18 20:21:22,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:21:22,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:21:22,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:22,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:21:22,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:21:22,955 INFO L87 Difference]: Start difference. First operand 380 states and 963 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:23,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:23,185 INFO L93 Difference]: Finished difference Result 524 states and 1294 transitions. [2022-11-18 20:21:23,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:21:23,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-18 20:21:23,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:23,188 INFO L225 Difference]: With dead ends: 524 [2022-11-18 20:21:23,188 INFO L226 Difference]: Without dead ends: 524 [2022-11-18 20:21:23,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:21:23,189 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 35 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:23,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 6 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:21:23,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-11-18 20:21:23,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 390. [2022-11-18 20:21:23,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 364 states have (on average 2.7335164835164836) internal successors, (995), 389 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 995 transitions. [2022-11-18 20:21:23,203 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 995 transitions. Word has length 8 [2022-11-18 20:21:23,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:23,204 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 995 transitions. [2022-11-18 20:21:23,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:23,204 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 995 transitions. [2022-11-18 20:21:23,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-18 20:21:23,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:23,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:21:23,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:21:23,205 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:21:23,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:23,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1615516673, now seen corresponding path program 1 times [2022-11-18 20:21:23,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:23,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316183993] [2022-11-18 20:21:23,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:23,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:23,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:23,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316183993] [2022-11-18 20:21:23,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316183993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:21:23,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:21:23,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:21:23,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404862500] [2022-11-18 20:21:23,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:21:23,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:21:23,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:23,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:21:23,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:21:23,406 INFO L87 Difference]: Start difference. First operand 390 states and 995 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:23,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:23,509 INFO L93 Difference]: Finished difference Result 504 states and 1262 transitions. [2022-11-18 20:21:23,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:21:23,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-18 20:21:23,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:23,512 INFO L225 Difference]: With dead ends: 504 [2022-11-18 20:21:23,513 INFO L226 Difference]: Without dead ends: 504 [2022-11-18 20:21:23,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:21:23,513 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 15 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:23,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:21:23,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-11-18 20:21:23,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 370. [2022-11-18 20:21:23,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 345 states have (on average 2.701449275362319) internal successors, (932), 369 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 932 transitions. [2022-11-18 20:21:23,527 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 932 transitions. Word has length 8 [2022-11-18 20:21:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:23,527 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 932 transitions. [2022-11-18 20:21:23,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 932 transitions. [2022-11-18 20:21:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-18 20:21:23,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:23,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:21:23,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:21:23,529 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:21:23,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:23,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1615469208, now seen corresponding path program 1 times [2022-11-18 20:21:23,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:23,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868164780] [2022-11-18 20:21:23,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:23,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:23,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:23,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868164780] [2022-11-18 20:21:23,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868164780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:21:23,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:21:23,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:21:23,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500712580] [2022-11-18 20:21:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:21:23,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:21:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:23,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:21:23,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:21:23,659 INFO L87 Difference]: Start difference. First operand 370 states and 932 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:23,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:23,745 INFO L93 Difference]: Finished difference Result 365 states and 918 transitions. [2022-11-18 20:21:23,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:21:23,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-18 20:21:23,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:23,748 INFO L225 Difference]: With dead ends: 365 [2022-11-18 20:21:23,748 INFO L226 Difference]: Without dead ends: 365 [2022-11-18 20:21:23,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:21:23,749 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:23,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:21:23,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-11-18 20:21:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2022-11-18 20:21:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 340 states have (on average 2.7) internal successors, (918), 364 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 918 transitions. [2022-11-18 20:21:23,781 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 918 transitions. Word has length 8 [2022-11-18 20:21:23,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:23,782 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 918 transitions. [2022-11-18 20:21:23,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 918 transitions. [2022-11-18 20:21:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 20:21:23,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:23,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:21:23,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:21:23,784 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:21:23,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:23,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1203112750, now seen corresponding path program 1 times [2022-11-18 20:21:23,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:23,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257495112] [2022-11-18 20:21:23,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:23,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:24,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:24,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257495112] [2022-11-18 20:21:24,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257495112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:21:24,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:21:24,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:21:24,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836068758] [2022-11-18 20:21:24,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:21:24,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:21:24,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:24,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:21:24,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:21:24,057 INFO L87 Difference]: Start difference. First operand 365 states and 918 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:24,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:24,201 INFO L93 Difference]: Finished difference Result 361 states and 906 transitions. [2022-11-18 20:21:24,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:21:24,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-18 20:21:24,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:24,204 INFO L225 Difference]: With dead ends: 361 [2022-11-18 20:21:24,204 INFO L226 Difference]: Without dead ends: 361 [2022-11-18 20:21:24,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:21:24,205 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:24,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:21:24,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-11-18 20:21:24,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2022-11-18 20:21:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 336 states have (on average 2.6964285714285716) internal successors, (906), 360 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 906 transitions. [2022-11-18 20:21:24,216 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 906 transitions. Word has length 9 [2022-11-18 20:21:24,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:24,216 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 906 transitions. [2022-11-18 20:21:24,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:24,216 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 906 transitions. [2022-11-18 20:21:24,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 20:21:24,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:24,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:21:24,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:21:24,218 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:21:24,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:24,218 INFO L85 PathProgramCache]: Analyzing trace with hash 184298592, now seen corresponding path program 1 times [2022-11-18 20:21:24,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:24,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956710063] [2022-11-18 20:21:24,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:24,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:24,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:24,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956710063] [2022-11-18 20:21:24,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956710063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:21:24,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:21:24,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:21:24,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505700916] [2022-11-18 20:21:24,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:21:24,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:21:24,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:24,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:21:24,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:21:24,613 INFO L87 Difference]: Start difference. First operand 361 states and 906 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:24,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:24,705 INFO L93 Difference]: Finished difference Result 349 states and 877 transitions. [2022-11-18 20:21:24,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:21:24,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-18 20:21:24,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:24,707 INFO L225 Difference]: With dead ends: 349 [2022-11-18 20:21:24,708 INFO L226 Difference]: Without dead ends: 349 [2022-11-18 20:21:24,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:21:24,709 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:24,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 2 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:21:24,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-11-18 20:21:24,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 325. [2022-11-18 20:21:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 301 states have (on average 2.7209302325581395) internal successors, (819), 324 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:24,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 819 transitions. [2022-11-18 20:21:24,721 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 819 transitions. Word has length 10 [2022-11-18 20:21:24,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:24,722 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 819 transitions. [2022-11-18 20:21:24,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:24,722 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 819 transitions. [2022-11-18 20:21:24,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 20:21:24,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:24,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:21:24,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:21:24,724 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:21:24,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:24,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1356739898, now seen corresponding path program 1 times [2022-11-18 20:21:24,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:24,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509381553] [2022-11-18 20:21:24,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:24,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:24,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:24,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509381553] [2022-11-18 20:21:24,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509381553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:21:24,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:21:24,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:21:24,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992484086] [2022-11-18 20:21:24,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:21:24,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:21:24,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:24,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:21:24,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:21:24,983 INFO L87 Difference]: Start difference. First operand 325 states and 819 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:25,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:25,092 INFO L93 Difference]: Finished difference Result 473 states and 1176 transitions. [2022-11-18 20:21:25,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:21:25,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-18 20:21:25,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:25,095 INFO L225 Difference]: With dead ends: 473 [2022-11-18 20:21:25,095 INFO L226 Difference]: Without dead ends: 473 [2022-11-18 20:21:25,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:21:25,097 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:25,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 2 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:21:25,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2022-11-18 20:21:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 360. [2022-11-18 20:21:25,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 336 states have (on average 2.6845238095238093) internal successors, (902), 359 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:25,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 902 transitions. [2022-11-18 20:21:25,109 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 902 transitions. Word has length 10 [2022-11-18 20:21:25,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:25,109 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 902 transitions. [2022-11-18 20:21:25,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:25,110 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 902 transitions. [2022-11-18 20:21:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 20:21:25,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:25,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:21:25,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:21:25,114 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:21:25,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:25,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1982708441, now seen corresponding path program 1 times [2022-11-18 20:21:25,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:25,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289032747] [2022-11-18 20:21:25,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:25,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:25,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:25,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289032747] [2022-11-18 20:21:25,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289032747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:21:25,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:21:25,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:21:25,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964277529] [2022-11-18 20:21:25,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:21:25,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:21:25,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:25,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:21:25,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:21:25,377 INFO L87 Difference]: Start difference. First operand 360 states and 902 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:25,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:25,561 INFO L93 Difference]: Finished difference Result 506 states and 1282 transitions. [2022-11-18 20:21:25,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:21:25,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-18 20:21:25,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:25,564 INFO L225 Difference]: With dead ends: 506 [2022-11-18 20:21:25,565 INFO L226 Difference]: Without dead ends: 486 [2022-11-18 20:21:25,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:21:25,565 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:25,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:21:25,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-11-18 20:21:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2022-11-18 20:21:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 462 states have (on average 2.632034632034632) internal successors, (1216), 485 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:25,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1216 transitions. [2022-11-18 20:21:25,579 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1216 transitions. Word has length 10 [2022-11-18 20:21:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:25,580 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 1216 transitions. [2022-11-18 20:21:25,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1216 transitions. [2022-11-18 20:21:25,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 20:21:25,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:25,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:21:25,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:21:25,581 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:21:25,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:25,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1982708481, now seen corresponding path program 1 times [2022-11-18 20:21:25,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:25,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944258569] [2022-11-18 20:21:25,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:25,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:25,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:25,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944258569] [2022-11-18 20:21:25,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944258569] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:21:25,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:21:25,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:21:25,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834003874] [2022-11-18 20:21:25,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:21:25,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:21:25,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:25,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:21:25,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:21:25,733 INFO L87 Difference]: Start difference. First operand 486 states and 1216 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:25,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:25,866 INFO L93 Difference]: Finished difference Result 248 states and 455 transitions. [2022-11-18 20:21:25,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:21:25,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-18 20:21:25,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:25,868 INFO L225 Difference]: With dead ends: 248 [2022-11-18 20:21:25,868 INFO L226 Difference]: Without dead ends: 195 [2022-11-18 20:21:25,868 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-11-18 20:21:25,869 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:25,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 8 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:21:25,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-18 20:21:25,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-11-18 20:21:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 183 states have (on average 1.8688524590163935) internal successors, (342), 194 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 342 transitions. [2022-11-18 20:21:25,874 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 342 transitions. Word has length 10 [2022-11-18 20:21:25,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:25,875 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 342 transitions. [2022-11-18 20:21:25,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 342 transitions. [2022-11-18 20:21:25,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 20:21:25,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:25,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:21:25,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:21:25,876 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:21:25,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:25,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1665615727, now seen corresponding path program 1 times [2022-11-18 20:21:25,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:25,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944105096] [2022-11-18 20:21:25,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:25,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:21:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:21:26,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:21:26,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944105096] [2022-11-18 20:21:26,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944105096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:21:26,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:21:26,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:21:26,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852918682] [2022-11-18 20:21:26,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:21:26,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:21:26,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:21:26,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:21:26,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:21:26,185 INFO L87 Difference]: Start difference. First operand 195 states and 342 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:26,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:21:26,320 INFO L93 Difference]: Finished difference Result 106 states and 165 transitions. [2022-11-18 20:21:26,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:21:26,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-18 20:21:26,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:21:26,321 INFO L225 Difference]: With dead ends: 106 [2022-11-18 20:21:26,321 INFO L226 Difference]: Without dead ends: 62 [2022-11-18 20:21:26,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:21:26,322 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 29 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:21:26,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 8 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:21:26,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-18 20:21:26,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-18 20:21:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 1.5) internal successors, (90), 61 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2022-11-18 20:21:26,325 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 13 [2022-11-18 20:21:26,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:21:26,325 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2022-11-18 20:21:26,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:21:26,325 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2022-11-18 20:21:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:21:26,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:21:26,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:21:26,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:21:26,326 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:21:26,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:21:26,327 INFO L85 PathProgramCache]: Analyzing trace with hash 663346817, now seen corresponding path program 1 times [2022-11-18 20:21:26,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:21:26,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161344367] [2022-11-18 20:21:26,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:21:26,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:21:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:21:26,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:21:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:21:26,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:21:26,556 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:21:26,557 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (63 of 64 remaining) [2022-11-18 20:21:26,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (62 of 64 remaining) [2022-11-18 20:21:26,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 64 remaining) [2022-11-18 20:21:26,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 64 remaining) [2022-11-18 20:21:26,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 64 remaining) [2022-11-18 20:21:26,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 64 remaining) [2022-11-18 20:21:26,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 64 remaining) [2022-11-18 20:21:26,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 64 remaining) [2022-11-18 20:21:26,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 64 remaining) [2022-11-18 20:21:26,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 64 remaining) [2022-11-18 20:21:26,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 64 remaining) [2022-11-18 20:21:26,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 64 remaining) [2022-11-18 20:21:26,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 64 remaining) [2022-11-18 20:21:26,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 64 remaining) [2022-11-18 20:21:26,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 64 remaining) [2022-11-18 20:21:26,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 64 remaining) [2022-11-18 20:21:26,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 64 remaining) [2022-11-18 20:21:26,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 64 remaining) [2022-11-18 20:21:26,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 64 remaining) [2022-11-18 20:21:26,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 64 remaining) [2022-11-18 20:21:26,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 64 remaining) [2022-11-18 20:21:26,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 64 remaining) [2022-11-18 20:21:26,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 64 remaining) [2022-11-18 20:21:26,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 64 remaining) [2022-11-18 20:21:26,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 64 remaining) [2022-11-18 20:21:26,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 64 remaining) [2022-11-18 20:21:26,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 64 remaining) [2022-11-18 20:21:26,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 64 remaining) [2022-11-18 20:21:26,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 64 remaining) [2022-11-18 20:21:26,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 64 remaining) [2022-11-18 20:21:26,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 64 remaining) [2022-11-18 20:21:26,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 64 remaining) [2022-11-18 20:21:26,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 64 remaining) [2022-11-18 20:21:26,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 64 remaining) [2022-11-18 20:21:26,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 64 remaining) [2022-11-18 20:21:26,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 64 remaining) [2022-11-18 20:21:26,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (27 of 64 remaining) [2022-11-18 20:21:26,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 64 remaining) [2022-11-18 20:21:26,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 64 remaining) [2022-11-18 20:21:26,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 64 remaining) [2022-11-18 20:21:26,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 64 remaining) [2022-11-18 20:21:26,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 64 remaining) [2022-11-18 20:21:26,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 64 remaining) [2022-11-18 20:21:26,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 64 remaining) [2022-11-18 20:21:26,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 64 remaining) [2022-11-18 20:21:26,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 64 remaining) [2022-11-18 20:21:26,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 64 remaining) [2022-11-18 20:21:26,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 64 remaining) [2022-11-18 20:21:26,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 64 remaining) [2022-11-18 20:21:26,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 64 remaining) [2022-11-18 20:21:26,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 64 remaining) [2022-11-18 20:21:26,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 64 remaining) [2022-11-18 20:21:26,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 64 remaining) [2022-11-18 20:21:26,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 64 remaining) [2022-11-18 20:21:26,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 64 remaining) [2022-11-18 20:21:26,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 64 remaining) [2022-11-18 20:21:26,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 64 remaining) [2022-11-18 20:21:26,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 64 remaining) [2022-11-18 20:21:26,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 64 remaining) [2022-11-18 20:21:26,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 64 remaining) [2022-11-18 20:21:26,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 64 remaining) [2022-11-18 20:21:26,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 64 remaining) [2022-11-18 20:21:26,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 64 remaining) [2022-11-18 20:21:26,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 64 remaining) [2022-11-18 20:21:26,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 20:21:26,572 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:21:26,577 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 20:21:26,577 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:21:26,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:21:26 BasicIcfg [2022-11-18 20:21:26,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:21:26,648 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:21:26,648 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:21:26,648 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:21:26,648 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:20:57" (3/4) ... [2022-11-18 20:21:26,651 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 20:21:26,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:21:26,652 INFO L158 Benchmark]: Toolchain (without parser) took 32208.55ms. Allocated memory was 121.6MB in the beginning and 276.8MB in the end (delta: 155.2MB). Free memory was 86.5MB in the beginning and 144.9MB in the end (delta: -58.4MB). Peak memory consumption was 95.9MB. Max. memory is 16.1GB. [2022-11-18 20:21:26,652 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 81.8MB. Free memory is still 36.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:21:26,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 682.90ms. Allocated memory is still 121.6MB. Free memory was 86.5MB in the beginning and 84.0MB in the end (delta: 2.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 20:21:26,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.39ms. Allocated memory is still 121.6MB. Free memory was 84.0MB in the beginning and 81.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:21:26,653 INFO L158 Benchmark]: Boogie Preprocessor took 64.65ms. Allocated memory is still 121.6MB. Free memory was 81.7MB in the beginning and 79.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:21:26,653 INFO L158 Benchmark]: RCFGBuilder took 1719.33ms. Allocated memory was 121.6MB in the beginning and 153.1MB in the end (delta: 31.5MB). Free memory was 79.0MB in the beginning and 79.9MB in the end (delta: -961.6kB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2022-11-18 20:21:26,653 INFO L158 Benchmark]: TraceAbstraction took 29620.31ms. Allocated memory was 153.1MB in the beginning and 276.8MB in the end (delta: 123.7MB). Free memory was 78.9MB in the beginning and 145.9MB in the end (delta: -67.0MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. [2022-11-18 20:21:26,654 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 276.8MB. Free memory is still 144.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:21:26,665 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.26ms. Allocated memory is still 81.8MB. Free memory is still 36.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 682.90ms. Allocated memory is still 121.6MB. Free memory was 86.5MB in the beginning and 84.0MB in the end (delta: 2.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.39ms. Allocated memory is still 121.6MB. Free memory was 84.0MB in the beginning and 81.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.65ms. Allocated memory is still 121.6MB. Free memory was 81.7MB in the beginning and 79.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1719.33ms. Allocated memory was 121.6MB in the beginning and 153.1MB in the end (delta: 31.5MB). Free memory was 79.0MB in the beginning and 79.9MB in the end (delta: -961.6kB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. * TraceAbstraction took 29620.31ms. Allocated memory was 153.1MB in the beginning and 276.8MB in the end (delta: 123.7MB). Free memory was 78.9MB in the beginning and 145.9MB in the end (delta: -67.0MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 276.8MB. Free memory is still 144.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.8s, 155 PlacesBefore, 64 PlacesAfterwards, 150 TransitionsBefore, 57 TransitionsAfterwards, 3984 CoEnabledTransitionPairs, 7 FixpointIterations, 66 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 137 TotalNumberOfCompositions, 16834 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5248, independent: 4850, independent conditional: 0, independent unconditional: 4850, dependent: 382, dependent conditional: 0, dependent unconditional: 382, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2103, independent: 2026, independent conditional: 0, independent unconditional: 2026, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2103, independent: 1899, independent conditional: 0, independent unconditional: 1899, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 204, independent: 127, independent conditional: 0, independent unconditional: 127, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1321, independent: 716, independent conditional: 0, independent unconditional: 716, dependent: 544, dependent conditional: 0, dependent unconditional: 544, unknown: 61, unknown conditional: 0, unknown unconditional: 61] ], Cache Queries: [ total: 5248, independent: 2824, independent conditional: 0, independent unconditional: 2824, dependent: 308, dependent conditional: 0, dependent unconditional: 308, unknown: 2116, unknown conditional: 0, unknown unconditional: 2116] , Statistics on independence cache: Total cache size (in pairs): 322, Positive cache size: 289, Positive conditional cache size: 0, Positive unconditional cache size: 289, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 3, Unknown conditional cache size: 0, Unknown unconditional cache size: 3 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L713] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L731] 0 _Bool x$flush_delayed; [L740] 0 int *x$read_delayed_var; [L747] 0 _Bool weak$$choice0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L748] 0 _Bool weak$$choice1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L749] 0 _Bool weak$$choice2; [L725] 0 int __unbuffered_p1_EAX$w_buff1; [L732] 0 int x$mem_tmp; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L723] 0 int __unbuffered_p1_EAX$w_buff0; [L710] 0 int __unbuffered_p0_EAX = 0; [L724] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L734] 0 _Bool x$r_buff0_thd1; [L712] 0 int __unbuffered_p1_EAX = 0; [L735] 0 _Bool x$r_buff0_thd2; [L733] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L714] 0 int __unbuffered_p1_EAX$mem_tmp; [L739] 0 _Bool x$read_delayed; [L708] 0 int __unbuffered_cnt = 0; [L728] 0 _Bool main$tmp_guard1; [L744] 0 _Bool x$w_buff1_used; [L727] 0 _Bool main$tmp_guard0; [L742] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff0; [L743] 0 int x$w_buff1; [L722] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L730] 0 int x = 0; [L737] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd0; [L746] 0 int y = 0; [L721] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L738] 0 _Bool x$r_buff1_thd2; [L825] 0 pthread_t t1923; [L826] FCALL, FORK 0 pthread_create(&t1923, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1923, ((void *)0), P0, ((void *)0))=0, t1923={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L827] 0 pthread_t t1924; [L828] FCALL, FORK 0 pthread_create(&t1924, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1924, ((void *)0), P1, ((void *)0))=1, t1923={7:0}, t1924={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 2 x$flush_delayed = weak$$choice2 [L784] EXPR 2 \read(x) [L784] 2 x$mem_tmp = x [L785] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] EXPR 2 \read(x) [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L793] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L794] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L795] EXPR 2 \read(x) [L795] 2 __unbuffered_p1_EAX = x [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] 2 x = x$flush_delayed ? x$mem_tmp : x [L797] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L800] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 \read(x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L753] 1 __unbuffered_p0_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L756] 1 x$w_buff1 = x$w_buff0 [L757] 1 x$w_buff0 = 1 [L758] 1 x$w_buff1_used = x$w_buff0_used [L759] 1 x$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L768] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L769] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L770] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L771] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 \read(x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923={7:0}, t1924={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L841] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 192 locations, 64 error locations. Started 1 CEGAR loops. OverallTime: 29.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 22.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 409 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1050 IncrementalHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 31 mSDtfsCounter, 1050 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3550occurred in iteration=0, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 700 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 687 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-18 20:21:26,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro --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 eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 --- 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-8393723 [2022-11-18 20:21:28,823 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:21:28,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:21:28,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:21:28,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:21:28,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:21:28,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:21:28,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:21:28,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:21:28,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:21:28,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:21:28,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:21:28,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:21:28,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:21:28,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:21:28,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:21:28,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:21:28,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:21:28,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:21:28,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:21:28,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:21:28,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:21:28,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:21:28,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:21:28,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:21:28,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:21:28,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:21:28,892 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:21:28,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:21:28,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:21:28,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:21:28,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:21:28,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:21:28,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:21:28,904 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:21:28,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:21:28,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:21:28,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:21:28,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:21:28,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:21:28,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:21:28,910 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-18 20:21:28,954 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:21:28,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:21:28,955 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:21:28,956 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:21:28,957 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:21:28,957 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:21:28,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:21:28,958 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:21:28,959 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:21:28,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:21:28,960 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:21:28,960 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:21:28,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:21:28,961 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:21:28,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:21:28,961 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:21:28,961 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:21:28,962 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:21:28,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:21:28,962 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:21:28,962 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 20:21:28,962 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 20:21:28,963 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:21:28,963 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:21:28,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:21:28,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:21:28,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:21:28,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:21:28,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:21:28,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:21:28,964 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 20:21:28,965 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 20:21:28,965 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 20:21:28,965 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/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_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro 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 -> eec124b30114ac40ce6b503b76c1b377fc7c0cddd0ece3b04d579d49ce56e9b5 [2022-11-18 20:21:29,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:21:29,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:21:29,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:21:29,411 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:21:29,414 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:21:29,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2022-11-18 20:21:29,490 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/data/f74803669/cdb2a364339a4f53a895e48fc8ec562b/FLAG5ca513e08 [2022-11-18 20:21:30,182 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:21:30,183 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i [2022-11-18 20:21:30,203 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/data/f74803669/cdb2a364339a4f53a895e48fc8ec562b/FLAG5ca513e08 [2022-11-18 20:21:30,413 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/data/f74803669/cdb2a364339a4f53a895e48fc8ec562b [2022-11-18 20:21:30,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:21:30,417 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:21:30,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:21:30,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:21:30,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:21:30,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:21:30" (1/1) ... [2022-11-18 20:21:30,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@135c3c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:21:30, skipping insertion in model container [2022-11-18 20:21:30,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:21:30" (1/1) ... [2022-11-18 20:21:30,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:21:30,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:21:30,638 WARN L234 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_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i[969,982] [2022-11-18 20:21:30,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:21:31,004 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:21:31,023 WARN L234 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_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/sv-benchmarks/c/pthread-wmm/safe006_power.opt-thin000_power.opt.i[969,982] [2022-11-18 20:21:31,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:21:31,153 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:21:31,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:21:31 WrapperNode [2022-11-18 20:21:31,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:21:31,156 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:21:31,156 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:21:31,156 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:21:31,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:21:31" (1/1) ... [2022-11-18 20:21:31,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:21:31" (1/1) ... [2022-11-18 20:21:31,241 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-11-18 20:21:31,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:21:31,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:21:31,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:21:31,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:21:31,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:21:31" (1/1) ... [2022-11-18 20:21:31,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:21:31" (1/1) ... [2022-11-18 20:21:31,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:21:31" (1/1) ... [2022-11-18 20:21:31,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:21:31" (1/1) ... [2022-11-18 20:21:31,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:21:31" (1/1) ... [2022-11-18 20:21:31,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:21:31" (1/1) ... [2022-11-18 20:21:31,299 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:21:31" (1/1) ... [2022-11-18 20:21:31,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:21:31" (1/1) ... [2022-11-18 20:21:31,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:21:31,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:21:31,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:21:31,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:21:31,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:21:31" (1/1) ... [2022-11-18 20:21:31,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:21:31,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:21:31,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:21:31,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:21:31,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-18 20:21:31,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 20:21:31,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:21:31,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:21:31,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:21:31,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-18 20:21:31,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 20:21:31,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-18 20:21:31,412 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 20:21:31,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 20:21:31,413 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 20:21:31,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 20:21:31,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 20:21:31,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:21:31,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:21:31,415 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:21:31,667 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:21:31,669 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:21:32,472 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:21:33,293 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:21:33,294 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:21:33,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:21:33 BoogieIcfgContainer [2022-11-18 20:21:33,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:21:33,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:21:33,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:21:33,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:21:33,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:21:30" (1/3) ... [2022-11-18 20:21:33,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a03c0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:21:33, skipping insertion in model container [2022-11-18 20:21:33,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:21:31" (2/3) ... [2022-11-18 20:21:33,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a03c0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:21:33, skipping insertion in model container [2022-11-18 20:21:33,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:21:33" (3/3) ... [2022-11-18 20:21:33,307 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.opt-thin000_power.opt.i [2022-11-18 20:21:33,330 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:21:33,330 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2022-11-18 20:21:33,330 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:21:33,522 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 20:21:33,573 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 20:21:33,587 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 151 transitions, 312 flow [2022-11-18 20:21:33,590 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 151 transitions, 312 flow [2022-11-18 20:21:33,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 151 transitions, 312 flow [2022-11-18 20:21:33,666 INFO L130 PetriNetUnfolder]: 2/149 cut-off events. [2022-11-18 20:21:33,667 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:21:33,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 149 events. 2/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 198 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-18 20:21:33,676 INFO L119 LiptonReduction]: Number of co-enabled transitions 3984 [2022-11-18 20:21:56,479 WARN L233 SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 234 DAG size of output: 232 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-18 20:22:19,858 INFO L134 LiptonReduction]: Checked pairs total: 16900 [2022-11-18 20:22:19,858 INFO L136 LiptonReduction]: Total number of compositions: 136 [2022-11-18 20:22:19,865 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 64 places, 57 transitions, 124 flow [2022-11-18 20:22:20,025 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3550 states, 2403 states have (on average 4.09779442363712) internal successors, (9847), 3549 states have internal predecessors, (9847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:20,044 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:22:20,048 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@649fa1b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:22:20,049 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-11-18 20:22:20,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 3550 states, 2403 states have (on average 4.09779442363712) internal successors, (9847), 3549 states have internal predecessors, (9847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:20,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 20:22:20,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:22:20,065 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 20:22:20,066 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:22:20,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:22:20,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1008, now seen corresponding path program 1 times [2022-11-18 20:22:20,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:22:20,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241504366] [2022-11-18 20:22:20,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:22:20,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:20,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:22:20,090 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:22:20,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-18 20:22:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:22:20,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 20:22:20,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:22:20,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:22:20,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:22:20,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241504366] [2022-11-18 20:22:20,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241504366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:22:20,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:22:20,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 20:22:20,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821817288] [2022-11-18 20:22:20,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:22:20,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:22:20,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:22:20,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:22:20,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:22:20,357 INFO L87 Difference]: Start difference. First operand has 3550 states, 2403 states have (on average 4.09779442363712) internal successors, (9847), 3549 states have internal predecessors, (9847), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:20,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:22:20,595 INFO L93 Difference]: Finished difference Result 1568 states and 4263 transitions. [2022-11-18 20:22:20,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:22:20,598 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-11-18 20:22:20,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:22:20,620 INFO L225 Difference]: With dead ends: 1568 [2022-11-18 20:22:20,620 INFO L226 Difference]: Without dead ends: 1568 [2022-11-18 20:22:20,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:22:20,624 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:22:20,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:22:20,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2022-11-18 20:22:20,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2022-11-18 20:22:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1191 states have (on average 3.579345088161209) internal successors, (4263), 1567 states have internal predecessors, (4263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:20,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 4263 transitions. [2022-11-18 20:22:20,740 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 4263 transitions. Word has length 1 [2022-11-18 20:22:20,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:22:20,740 INFO L495 AbstractCegarLoop]: Abstraction has 1568 states and 4263 transitions. [2022-11-18 20:22:20,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:20,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 4263 transitions. [2022-11-18 20:22:20,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-18 20:22:20,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:22:20,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-18 20:22:20,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:22:20,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:20,955 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:22:20,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:22:20,955 INFO L85 PathProgramCache]: Analyzing trace with hash 30836408, now seen corresponding path program 1 times [2022-11-18 20:22:20,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:22:20,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320294277] [2022-11-18 20:22:20,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:22:20,958 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:20,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:22:20,962 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:22:20,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-18 20:22:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:22:21,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:22:21,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:21,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:22:21,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:22:21,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:22:21,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320294277] [2022-11-18 20:22:21,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320294277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:22:21,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:22:21,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:22:21,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834501632] [2022-11-18 20:22:21,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:22:21,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:22:21,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:22:21,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:22:21,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:22:21,147 INFO L87 Difference]: Start difference. First operand 1568 states and 4263 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-11-18 20:22:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:22:21,426 INFO L93 Difference]: Finished difference Result 1411 states and 3820 transitions. [2022-11-18 20:22:21,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:22:21,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-11-18 20:22:21,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:22:21,435 INFO L225 Difference]: With dead ends: 1411 [2022-11-18 20:22:21,436 INFO L226 Difference]: Without dead ends: 1411 [2022-11-18 20:22:21,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:22:21,437 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:22:21,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:22:21,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-11-18 20:22:21,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1411. [2022-11-18 20:22:21,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1097 states have (on average 3.4822242479489516) internal successors, (3820), 1410 states have internal predecessors, (3820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 3820 transitions. [2022-11-18 20:22:21,482 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 3820 transitions. Word has length 4 [2022-11-18 20:22:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:22:21,482 INFO L495 AbstractCegarLoop]: Abstraction has 1411 states and 3820 transitions. [2022-11-18 20:22:21,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-11-18 20:22:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 3820 transitions. [2022-11-18 20:22:21,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:22:21,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:22:21,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:22:21,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:22:21,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:21,700 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:22:21,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:22:21,700 INFO L85 PathProgramCache]: Analyzing trace with hash 955929482, now seen corresponding path program 1 times [2022-11-18 20:22:21,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:22:21,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832318283] [2022-11-18 20:22:21,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:22:21,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:21,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:22:21,702 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:22:21,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-18 20:22:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:22:21,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:22:21,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:22:21,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:22:21,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:22:21,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832318283] [2022-11-18 20:22:21,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832318283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:22:21,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:22:21,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:22:21,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515288910] [2022-11-18 20:22:21,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:22:21,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:22:21,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:22:21,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:22:21,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:22:21,902 INFO L87 Difference]: Start difference. First operand 1411 states and 3820 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:22,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:22:22,254 INFO L93 Difference]: Finished difference Result 1777 states and 4817 transitions. [2022-11-18 20:22:22,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:22:22,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-18 20:22:22,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:22:22,267 INFO L225 Difference]: With dead ends: 1777 [2022-11-18 20:22:22,268 INFO L226 Difference]: Without dead ends: 1777 [2022-11-18 20:22:22,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:22:22,269 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:22:22,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 6 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:22:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2022-11-18 20:22:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1505. [2022-11-18 20:22:22,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1207 states have (on average 3.591549295774648) internal successors, (4335), 1504 states have internal predecessors, (4335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 4335 transitions. [2022-11-18 20:22:22,324 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 4335 transitions. Word has length 5 [2022-11-18 20:22:22,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:22:22,325 INFO L495 AbstractCegarLoop]: Abstraction has 1505 states and 4335 transitions. [2022-11-18 20:22:22,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:22,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 4335 transitions. [2022-11-18 20:22:22,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:22:22,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:22:22,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:22:22,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:22:22,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:22,538 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:22:22,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:22:22,538 INFO L85 PathProgramCache]: Analyzing trace with hash 955929484, now seen corresponding path program 1 times [2022-11-18 20:22:22,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:22:22,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867450456] [2022-11-18 20:22:22,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:22:22,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:22,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:22:22,541 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:22:22,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-18 20:22:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:22:22,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:22:22,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:22,792 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-18 20:22:22,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-18 20:22:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:22:22,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:22:22,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:22:22,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867450456] [2022-11-18 20:22:22,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867450456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:22:22,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:22:22,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:22:22,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285900703] [2022-11-18 20:22:22,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:22:22,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:22:22,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:22:22,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:22:22,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:22:22,851 INFO L87 Difference]: Start difference. First operand 1505 states and 4335 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:23,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:22:23,079 INFO L93 Difference]: Finished difference Result 906 states and 2496 transitions. [2022-11-18 20:22:23,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:22:23,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-18 20:22:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:22:23,085 INFO L225 Difference]: With dead ends: 906 [2022-11-18 20:22:23,085 INFO L226 Difference]: Without dead ends: 906 [2022-11-18 20:22:23,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:22:23,087 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:22:23,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:22:23,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-11-18 20:22:23,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 906. [2022-11-18 20:22:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 779 states have (on average 3.20410783055199) internal successors, (2496), 905 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 2496 transitions. [2022-11-18 20:22:23,130 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 2496 transitions. Word has length 5 [2022-11-18 20:22:23,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:22:23,130 INFO L495 AbstractCegarLoop]: Abstraction has 906 states and 2496 transitions. [2022-11-18 20:22:23,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 2496 transitions. [2022-11-18 20:22:23,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:22:23,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:22:23,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:22:23,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:22:23,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:23,343 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:22:23,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:22:23,343 INFO L85 PathProgramCache]: Analyzing trace with hash 955929485, now seen corresponding path program 1 times [2022-11-18 20:22:23,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:22:23,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234661449] [2022-11-18 20:22:23,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:22:23,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:23,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:22:23,346 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:22:23,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-18 20:22:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:22:23,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:22:23,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:23,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:22:23,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:22:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:22:23,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:22:23,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:22:23,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234661449] [2022-11-18 20:22:23,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234661449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:22:23,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:22:23,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:22:23,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919706617] [2022-11-18 20:22:23,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:22:23,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:22:23,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:22:23,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:22:23,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:22:23,558 INFO L87 Difference]: Start difference. First operand 906 states and 2496 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:23,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:22:23,682 INFO L93 Difference]: Finished difference Result 413 states and 1048 transitions. [2022-11-18 20:22:23,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:22:23,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-18 20:22:23,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:22:23,685 INFO L225 Difference]: With dead ends: 413 [2022-11-18 20:22:23,685 INFO L226 Difference]: Without dead ends: 413 [2022-11-18 20:22:23,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:22:23,686 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:22:23,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:22:23,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-18 20:22:23,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 390. [2022-11-18 20:22:23,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 364 states have (on average 2.7225274725274726) internal successors, (991), 389 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:23,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 991 transitions. [2022-11-18 20:22:23,699 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 991 transitions. Word has length 5 [2022-11-18 20:22:23,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:22:23,699 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 991 transitions. [2022-11-18 20:22:23,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 991 transitions. [2022-11-18 20:22:23,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-18 20:22:23,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:22:23,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:22:23,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:22:23,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:23,912 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:22:23,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:22:23,913 INFO L85 PathProgramCache]: Analyzing trace with hash -442113129, now seen corresponding path program 1 times [2022-11-18 20:22:23,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:22:23,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108110379] [2022-11-18 20:22:23,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:22:23,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:23,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:22:23,915 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:22:23,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-18 20:22:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:22:24,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:22:24,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:24,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:22:24,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:22:24,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:22:24,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108110379] [2022-11-18 20:22:24,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108110379] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:22:24,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:22:24,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:22:24,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565252330] [2022-11-18 20:22:24,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:22:24,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:22:24,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:22:24,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:22:24,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:22:24,104 INFO L87 Difference]: Start difference. First operand 390 states and 991 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:24,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:22:24,269 INFO L93 Difference]: Finished difference Result 380 states and 963 transitions. [2022-11-18 20:22:24,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:22:24,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-11-18 20:22:24,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:22:24,272 INFO L225 Difference]: With dead ends: 380 [2022-11-18 20:22:24,272 INFO L226 Difference]: Without dead ends: 380 [2022-11-18 20:22:24,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:22:24,274 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:22:24,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:22:24,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-18 20:22:24,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-11-18 20:22:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 354 states have (on average 2.7203389830508473) internal successors, (963), 379 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 963 transitions. [2022-11-18 20:22:24,286 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 963 transitions. Word has length 7 [2022-11-18 20:22:24,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:22:24,286 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 963 transitions. [2022-11-18 20:22:24,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:24,286 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 963 transitions. [2022-11-18 20:22:24,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-18 20:22:24,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:22:24,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:22:24,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:22:24,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:24,488 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:22:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:22:24,488 INFO L85 PathProgramCache]: Analyzing trace with hash -820604182, now seen corresponding path program 1 times [2022-11-18 20:22:24,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:22:24,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341925113] [2022-11-18 20:22:24,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:22:24,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:24,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:22:24,490 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:22:24,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-18 20:22:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:22:24,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:22:24,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:24,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:22:24,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:22:24,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:22:24,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341925113] [2022-11-18 20:22:24,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341925113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:22:24,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:22:24,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:22:24,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720402781] [2022-11-18 20:22:24,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:22:24,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:22:24,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:22:24,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:22:24,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:22:24,677 INFO L87 Difference]: Start difference. First operand 380 states and 963 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:24,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:22:24,966 INFO L93 Difference]: Finished difference Result 163 states and 304 transitions. [2022-11-18 20:22:24,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:22:24,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-18 20:22:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:22:24,971 INFO L225 Difference]: With dead ends: 163 [2022-11-18 20:22:24,972 INFO L226 Difference]: Without dead ends: 138 [2022-11-18 20:22:24,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-11-18 20:22:24,973 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:22:24,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 8 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:22:24,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-18 20:22:24,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-11-18 20:22:24,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 124 states have (on average 2.0) internal successors, (248), 137 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 248 transitions. [2022-11-18 20:22:24,978 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 248 transitions. Word has length 8 [2022-11-18 20:22:24,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:22:24,978 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 248 transitions. [2022-11-18 20:22:24,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:24,979 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 248 transitions. [2022-11-18 20:22:24,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:22:24,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:22:24,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:22:25,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:22:25,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:25,199 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:22:25,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:22:25,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1042377783, now seen corresponding path program 1 times [2022-11-18 20:22:25,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:22:25,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809932958] [2022-11-18 20:22:25,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:22:25,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:25,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:22:25,201 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:22:25,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-18 20:22:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:22:25,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:22:25,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:26,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-18 20:22:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:22:26,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:22:26,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:22:26,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809932958] [2022-11-18 20:22:26,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809932958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:22:26,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:22:26,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:22:26,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499403948] [2022-11-18 20:22:26,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:22:26,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:22:26,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:22:26,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:22:26,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:22:26,929 INFO L87 Difference]: Start difference. First operand 138 states and 248 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:27,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:22:27,201 INFO L93 Difference]: Finished difference Result 146 states and 256 transitions. [2022-11-18 20:22:27,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:22:27,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-18 20:22:27,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:22:27,203 INFO L225 Difference]: With dead ends: 146 [2022-11-18 20:22:27,203 INFO L226 Difference]: Without dead ends: 146 [2022-11-18 20:22:27,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-11-18 20:22:27,204 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:22:27,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 5 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:22:27,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-18 20:22:27,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2022-11-18 20:22:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 117 states have (on average 1.9914529914529915) internal successors, (233), 129 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 233 transitions. [2022-11-18 20:22:27,211 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 233 transitions. Word has length 11 [2022-11-18 20:22:27,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:22:27,212 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 233 transitions. [2022-11-18 20:22:27,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 233 transitions. [2022-11-18 20:22:27,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:22:27,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:22:27,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:22:27,226 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-11-18 20:22:27,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:27,414 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:22:27,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:22:27,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1042377782, now seen corresponding path program 1 times [2022-11-18 20:22:27,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:22:27,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234172503] [2022-11-18 20:22:27,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:22:27,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:27,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:22:27,417 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:22:27,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-18 20:22:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:22:27,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:22:27,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:30,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-18 20:22:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:22:30,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:22:30,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:22:30,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234172503] [2022-11-18 20:22:30,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234172503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:22:30,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:22:30,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:22:30,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062924185] [2022-11-18 20:22:30,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:22:30,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:22:30,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:22:30,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:22:30,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:22:30,050 INFO L87 Difference]: Start difference. First operand 130 states and 233 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:22:30,345 INFO L93 Difference]: Finished difference Result 191 states and 336 transitions. [2022-11-18 20:22:30,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:22:30,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-18 20:22:30,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:22:30,347 INFO L225 Difference]: With dead ends: 191 [2022-11-18 20:22:30,347 INFO L226 Difference]: Without dead ends: 191 [2022-11-18 20:22:30,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-11-18 20:22:30,348 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:22:30,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 6 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:22:30,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-18 20:22:30,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 146. [2022-11-18 20:22:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 133 states have (on average 1.9774436090225564) internal successors, (263), 145 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 263 transitions. [2022-11-18 20:22:30,360 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 263 transitions. Word has length 11 [2022-11-18 20:22:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:22:30,360 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 263 transitions. [2022-11-18 20:22:30,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 263 transitions. [2022-11-18 20:22:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:22:30,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:22:30,362 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:22:30,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:22:30,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:30,579 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:22:30,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:22:30,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1632800408, now seen corresponding path program 1 times [2022-11-18 20:22:30,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:22:30,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094306307] [2022-11-18 20:22:30,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:22:30,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:30,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:22:30,581 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:22:30,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-18 20:22:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:22:30,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:22:30,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:22:30,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:22:30,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:22:30,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094306307] [2022-11-18 20:22:30,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094306307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:22:30,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:22:30,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:22:30,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161438559] [2022-11-18 20:22:30,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:22:30,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:22:30,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:22:30,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:22:30,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:22:30,790 INFO L87 Difference]: Start difference. First operand 146 states and 263 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:22:31,073 INFO L93 Difference]: Finished difference Result 77 states and 121 transitions. [2022-11-18 20:22:31,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:22:31,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2022-11-18 20:22:31,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:22:31,075 INFO L225 Difference]: With dead ends: 77 [2022-11-18 20:22:31,075 INFO L226 Difference]: Without dead ends: 62 [2022-11-18 20:22:31,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:22:31,076 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:22:31,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 14 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:22:31,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-18 20:22:31,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-18 20:22:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.6101694915254237) internal successors, (95), 61 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2022-11-18 20:22:31,081 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 12 [2022-11-18 20:22:31,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:22:31,081 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2022-11-18 20:22:31,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:22:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2022-11-18 20:22:31,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:22:31,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:22:31,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:22:31,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:22:31,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:31,298 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:22:31,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:22:31,299 INFO L85 PathProgramCache]: Analyzing trace with hash 875286876, now seen corresponding path program 1 times [2022-11-18 20:22:31,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:22:31,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874235011] [2022-11-18 20:22:31,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:22:31,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:22:31,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:22:31,300 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:22:31,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-18 20:22:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:22:31,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:22:31,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:22:31,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-18 20:22:31,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-18 20:23:40,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-18 20:23:40,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:23:40,687 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:23:40,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:23:40,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874235011] [2022-11-18 20:23:40,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874235011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:23:40,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:23:40,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:23:40,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772889546] [2022-11-18 20:23:40,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:23:40,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:23:40,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:23:40,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:23:40,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:23:40,689 INFO L87 Difference]: Start difference. First operand 62 states and 95 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:23:41,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:23:41,016 INFO L93 Difference]: Finished difference Result 82 states and 119 transitions. [2022-11-18 20:23:41,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:23:41,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-18 20:23:41,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:23:41,018 INFO L225 Difference]: With dead ends: 82 [2022-11-18 20:23:41,018 INFO L226 Difference]: Without dead ends: 82 [2022-11-18 20:23:41,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:23:41,019 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 60 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:23:41,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 9 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:23:41,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-18 20:23:41,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 48. [2022-11-18 20:23:41,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 47 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:23:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 75 transitions. [2022-11-18 20:23:41,023 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 75 transitions. Word has length 15 [2022-11-18 20:23:41,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:23:41,024 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 75 transitions. [2022-11-18 20:23:41,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:23:41,024 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 75 transitions. [2022-11-18 20:23:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:23:41,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:23:41,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:23:41,042 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-11-18 20:23:41,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:23:41,242 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:23:41,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:41,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1364090278, now seen corresponding path program 1 times [2022-11-18 20:23:41,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:23:41,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166658495] [2022-11-18 20:23:41,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:23:41,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:23:41,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:23:41,244 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:23:41,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-18 20:23:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:23:41,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:23:41,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:23:41,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:23:41,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:23:41,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:23:41,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166658495] [2022-11-18 20:23:41,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166658495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:23:41,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:23:41,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:23:41,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236443125] [2022-11-18 20:23:41,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:23:41,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:23:41,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:23:41,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:23:41,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:23:41,536 INFO L87 Difference]: Start difference. First operand 48 states and 75 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:23:41,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:23:41,710 INFO L93 Difference]: Finished difference Result 65 states and 97 transitions. [2022-11-18 20:23:41,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:23:41,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-18 20:23:41,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:23:41,711 INFO L225 Difference]: With dead ends: 65 [2022-11-18 20:23:41,711 INFO L226 Difference]: Without dead ends: 65 [2022-11-18 20:23:41,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-11-18 20:23:41,712 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:23:41,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:23:41,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-18 20:23:41,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2022-11-18 20:23:41,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 1.5833333333333333) internal successors, (95), 61 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:23:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2022-11-18 20:23:41,715 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 16 [2022-11-18 20:23:41,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:23:41,715 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2022-11-18 20:23:41,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:23:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2022-11-18 20:23:41,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:23:41,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:23:41,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:23:41,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-18 20:23:41,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:23:41,918 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-18 20:23:41,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:23:41,919 INFO L85 PathProgramCache]: Analyzing trace with hash -737663872, now seen corresponding path program 2 times [2022-11-18 20:23:41,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:23:41,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484339000] [2022-11-18 20:23:41,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:23:41,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:23:41,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:23:41,921 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:23:41,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-18 20:23:42,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 20:23:42,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-18 20:23:42,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:23:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:23:42,422 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-18 20:23:42,422 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:23:42,424 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (63 of 64 remaining) [2022-11-18 20:23:42,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (62 of 64 remaining) [2022-11-18 20:23:42,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 64 remaining) [2022-11-18 20:23:42,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 64 remaining) [2022-11-18 20:23:42,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 64 remaining) [2022-11-18 20:23:42,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 64 remaining) [2022-11-18 20:23:42,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 64 remaining) [2022-11-18 20:23:42,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 64 remaining) [2022-11-18 20:23:42,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 64 remaining) [2022-11-18 20:23:42,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 64 remaining) [2022-11-18 20:23:42,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 64 remaining) [2022-11-18 20:23:42,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 64 remaining) [2022-11-18 20:23:42,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 64 remaining) [2022-11-18 20:23:42,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 64 remaining) [2022-11-18 20:23:42,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 64 remaining) [2022-11-18 20:23:42,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 64 remaining) [2022-11-18 20:23:42,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 64 remaining) [2022-11-18 20:23:42,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 64 remaining) [2022-11-18 20:23:42,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 64 remaining) [2022-11-18 20:23:42,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 64 remaining) [2022-11-18 20:23:42,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 64 remaining) [2022-11-18 20:23:42,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 64 remaining) [2022-11-18 20:23:42,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 64 remaining) [2022-11-18 20:23:42,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 64 remaining) [2022-11-18 20:23:42,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 64 remaining) [2022-11-18 20:23:42,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 64 remaining) [2022-11-18 20:23:42,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 64 remaining) [2022-11-18 20:23:42,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 64 remaining) [2022-11-18 20:23:42,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 64 remaining) [2022-11-18 20:23:42,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 64 remaining) [2022-11-18 20:23:42,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 64 remaining) [2022-11-18 20:23:42,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 64 remaining) [2022-11-18 20:23:42,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 64 remaining) [2022-11-18 20:23:42,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 64 remaining) [2022-11-18 20:23:42,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 64 remaining) [2022-11-18 20:23:42,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 64 remaining) [2022-11-18 20:23:42,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (27 of 64 remaining) [2022-11-18 20:23:42,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 64 remaining) [2022-11-18 20:23:42,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 64 remaining) [2022-11-18 20:23:42,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 64 remaining) [2022-11-18 20:23:42,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 64 remaining) [2022-11-18 20:23:42,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 64 remaining) [2022-11-18 20:23:42,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 64 remaining) [2022-11-18 20:23:42,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 64 remaining) [2022-11-18 20:23:42,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 64 remaining) [2022-11-18 20:23:42,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 64 remaining) [2022-11-18 20:23:42,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 64 remaining) [2022-11-18 20:23:42,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 64 remaining) [2022-11-18 20:23:42,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 64 remaining) [2022-11-18 20:23:42,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 64 remaining) [2022-11-18 20:23:42,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 64 remaining) [2022-11-18 20:23:42,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 64 remaining) [2022-11-18 20:23:42,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 64 remaining) [2022-11-18 20:23:42,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 64 remaining) [2022-11-18 20:23:42,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 64 remaining) [2022-11-18 20:23:42,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 64 remaining) [2022-11-18 20:23:42,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 64 remaining) [2022-11-18 20:23:42,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 64 remaining) [2022-11-18 20:23:42,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 64 remaining) [2022-11-18 20:23:42,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 64 remaining) [2022-11-18 20:23:42,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 64 remaining) [2022-11-18 20:23:42,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 64 remaining) [2022-11-18 20:23:42,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 64 remaining) [2022-11-18 20:23:42,438 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 64 remaining) [2022-11-18 20:23:42,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-18 20:23:42,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:23:42,659 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:23:42,665 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 20:23:42,665 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:23:42,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:23:42 BasicIcfg [2022-11-18 20:23:42,754 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:23:42,754 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:23:42,754 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:23:42,755 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:23:42,755 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:21:33" (3/4) ... [2022-11-18 20:23:42,758 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 20:23:42,758 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:23:42,759 INFO L158 Benchmark]: Toolchain (without parser) took 132341.54ms. Allocated memory was 73.4MB in the beginning and 746.6MB in the end (delta: 673.2MB). Free memory was 55.2MB in the beginning and 423.4MB in the end (delta: -368.2MB). Peak memory consumption was 305.2MB. Max. memory is 16.1GB. [2022-11-18 20:23:42,759 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 73.4MB. Free memory is still 54.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:23:42,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.36ms. Allocated memory is still 73.4MB. Free memory was 55.0MB in the beginning and 43.0MB in the end (delta: 12.0MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2022-11-18 20:23:42,760 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.27ms. Allocated memory is still 73.4MB. Free memory was 43.0MB in the beginning and 40.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:23:42,761 INFO L158 Benchmark]: Boogie Preprocessor took 76.33ms. Allocated memory is still 73.4MB. Free memory was 40.4MB in the beginning and 38.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:23:42,761 INFO L158 Benchmark]: RCFGBuilder took 1977.45ms. Allocated memory was 73.4MB in the beginning and 104.9MB in the end (delta: 31.5MB). Free memory was 38.0MB in the beginning and 58.9MB in the end (delta: -20.9MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2022-11-18 20:23:42,762 INFO L158 Benchmark]: TraceAbstraction took 129453.89ms. Allocated memory was 104.9MB in the beginning and 746.6MB in the end (delta: 641.7MB). Free memory was 58.0MB in the beginning and 423.4MB in the end (delta: -365.4MB). Peak memory consumption was 277.2MB. Max. memory is 16.1GB. [2022-11-18 20:23:42,762 INFO L158 Benchmark]: Witness Printer took 4.06ms. Allocated memory is still 746.6MB. Free memory is still 423.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:23:42,766 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.68ms. Allocated memory is still 73.4MB. Free memory is still 54.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 736.36ms. Allocated memory is still 73.4MB. Free memory was 55.0MB in the beginning and 43.0MB in the end (delta: 12.0MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.27ms. Allocated memory is still 73.4MB. Free memory was 43.0MB in the beginning and 40.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.33ms. Allocated memory is still 73.4MB. Free memory was 40.4MB in the beginning and 38.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1977.45ms. Allocated memory was 73.4MB in the beginning and 104.9MB in the end (delta: 31.5MB). Free memory was 38.0MB in the beginning and 58.9MB in the end (delta: -20.9MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * TraceAbstraction took 129453.89ms. Allocated memory was 104.9MB in the beginning and 746.6MB in the end (delta: 641.7MB). Free memory was 58.0MB in the beginning and 423.4MB in the end (delta: -365.4MB). Peak memory consumption was 277.2MB. Max. memory is 16.1GB. * Witness Printer took 4.06ms. Allocated memory is still 746.6MB. Free memory is still 423.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 46.3s, 156 PlacesBefore, 64 PlacesAfterwards, 151 TransitionsBefore, 57 TransitionsAfterwards, 3984 CoEnabledTransitionPairs, 7 FixpointIterations, 65 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 136 TotalNumberOfCompositions, 16900 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5484, independent: 5084, independent conditional: 0, independent unconditional: 5084, dependent: 385, dependent conditional: 0, dependent unconditional: 385, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2145, independent: 2067, independent conditional: 0, independent unconditional: 2067, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2145, independent: 1928, independent conditional: 0, independent unconditional: 1928, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 217, independent: 139, independent conditional: 0, independent unconditional: 139, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2298, independent: 883, independent conditional: 0, independent unconditional: 883, dependent: 1321, dependent conditional: 0, dependent unconditional: 1321, unknown: 94, unknown conditional: 0, unknown unconditional: 94] ], Cache Queries: [ total: 5484, independent: 3017, independent conditional: 0, independent unconditional: 3017, dependent: 310, dependent conditional: 0, dependent unconditional: 310, unknown: 2157, unknown conditional: 0, unknown unconditional: 2157] , Statistics on independence cache: Total cache size (in pairs): 360, Positive cache size: 327, Positive conditional cache size: 0, Positive unconditional cache size: 327, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 3, Unknown conditional cache size: 0, Unknown unconditional cache size: 3 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L713] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L731] 0 _Bool x$flush_delayed; [L740] 0 int *x$read_delayed_var; [L747] 0 _Bool weak$$choice0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L748] 0 _Bool weak$$choice1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L749] 0 _Bool weak$$choice2; [L725] 0 int __unbuffered_p1_EAX$w_buff1; [L732] 0 int x$mem_tmp; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L723] 0 int __unbuffered_p1_EAX$w_buff0; [L710] 0 int __unbuffered_p0_EAX = 0; [L724] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L734] 0 _Bool x$r_buff0_thd1; [L712] 0 int __unbuffered_p1_EAX = 0; [L735] 0 _Bool x$r_buff0_thd2; [L733] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L714] 0 int __unbuffered_p1_EAX$mem_tmp; [L739] 0 _Bool x$read_delayed; [L708] 0 int __unbuffered_cnt = 0; [L728] 0 _Bool main$tmp_guard1; [L744] 0 _Bool x$w_buff1_used; [L727] 0 _Bool main$tmp_guard0; [L742] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff0; [L743] 0 int x$w_buff1; [L722] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L730] 0 int x = 0; [L737] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd0; [L746] 0 int y = 0; [L721] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L738] 0 _Bool x$r_buff1_thd2; [L825] 0 pthread_t t1923; [L826] FCALL, FORK 0 pthread_create(&t1923, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1923, ((void *)0), P0, ((void *)0))=0, t1923={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L827] 0 pthread_t t1924; [L828] FCALL, FORK 0 pthread_create(&t1924, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1924, ((void *)0), P1, ((void *)0))=1, t1923={7:0}, t1924={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 2 x$flush_delayed = weak$$choice2 [L784] EXPR 2 \read(x) [L784] 2 x$mem_tmp = x [L785] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] EXPR 2 \read(x) [L786] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L786] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L793] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L794] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L795] EXPR 2 \read(x) [L795] 2 __unbuffered_p1_EAX = x [L796] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L796] 2 x = x$flush_delayed ? x$mem_tmp : x [L797] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L800] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 \read(x) [L803] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L753] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L756] 1 x$w_buff1 = x$w_buff0 [L757] 1 x$w_buff0 = 1 [L758] 1 x$w_buff1_used = x$w_buff0_used [L759] 1 x$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L768] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L769] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L770] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L771] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 \read(x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1923={7:0}, t1924={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L841] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L842] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L842] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L842] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=2, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 193 locations, 64 error locations. Started 1 CEGAR loops. OverallTime: 129.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 46.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 268 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 268 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 830 IncrementalHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 30 mSDtfsCounter, 830 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3550occurred in iteration=0, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 393 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 73.6s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 473 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1293 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-18 20:23:42,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6fbbcb0e-19a7-4f34-9b47-bcfc2e6e625e/bin/uautomizer-TMbwUNV5ro/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: UNKNOWN: Overapproximated counterexample