./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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_ec7494ea-aa70-4f93-9052-3181e4850edd/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 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc --- 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:51:15,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:51:15,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:51:16,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:51:16,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:51:16,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:51:16,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:51:16,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:51:16,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:51:16,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:51:16,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:51:16,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:51:16,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:51:16,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:51:16,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:51:16,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:51:16,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:51:16,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:51:16,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:51:16,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:51:16,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:51:16,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:51:16,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:51:16,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:51:16,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:51:16,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:51:16,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:51:16,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:51:16,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:51:16,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:51:16,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:51:16,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:51:16,068 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:51:16,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:51:16,070 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:51:16,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:51:16,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:51:16,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:51:16,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:51:16,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:51:16,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:51:16,079 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 20:51:16,120 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:51:16,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:51:16,122 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:51:16,122 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:51:16,123 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:51:16,124 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:51:16,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:51:16,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:51:16,125 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:51:16,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:51:16,126 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:51:16,126 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:51:16,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:51:16,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:51:16,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:51:16,127 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:51:16,128 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:51:16,128 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:51:16,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:51:16,128 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:51:16,129 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:51:16,129 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:51:16,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:51:16,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:51:16,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:51:16,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:51:16,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:51:16,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:51:16,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:51:16,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:51:16,132 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_ec7494ea-aa70-4f93-9052-3181e4850edd/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_ec7494ea-aa70-4f93-9052-3181e4850edd/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 -> 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc [2022-11-18 20:51:16,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:51:16,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:51:16,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:51:16,435 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:51:16,436 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:51:16,438 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2022-11-18 20:51:16,527 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/data/057bd8ef0/ed98c1aa08234ecf8ce3bb67b84f0d59/FLAG8ed0ae458 [2022-11-18 20:51:17,164 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:51:17,165 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2022-11-18 20:51:17,180 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/data/057bd8ef0/ed98c1aa08234ecf8ce3bb67b84f0d59/FLAG8ed0ae458 [2022-11-18 20:51:17,482 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/data/057bd8ef0/ed98c1aa08234ecf8ce3bb67b84f0d59 [2022-11-18 20:51:17,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:51:17,490 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:51:17,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:51:17,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:51:17,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:51:17,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:51:17" (1/1) ... [2022-11-18 20:51:17,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49dec1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:17, skipping insertion in model container [2022-11-18 20:51:17,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:51:17" (1/1) ... [2022-11-18 20:51:17,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:51:17,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:51:17,860 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_ec7494ea-aa70-4f93-9052-3181e4850edd/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-18 20:51:18,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:51:18,216 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:51:18,233 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_ec7494ea-aa70-4f93-9052-3181e4850edd/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-18 20:51:18,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:51:18,369 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:51:18,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:18 WrapperNode [2022-11-18 20:51:18,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:51:18,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:51:18,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:51:18,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:51:18,382 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:51:18" (1/1) ... [2022-11-18 20:51:18,404 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:51:18" (1/1) ... [2022-11-18 20:51:18,431 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-11-18 20:51:18,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:51:18,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:51:18,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:51:18,433 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:51:18,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:18" (1/1) ... [2022-11-18 20:51:18,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:18" (1/1) ... [2022-11-18 20:51:18,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:18" (1/1) ... [2022-11-18 20:51:18,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:18" (1/1) ... [2022-11-18 20:51:18,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:18" (1/1) ... [2022-11-18 20:51:18,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:18" (1/1) ... [2022-11-18 20:51:18,475 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:18" (1/1) ... [2022-11-18 20:51:18,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:18" (1/1) ... [2022-11-18 20:51:18,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:51:18,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:51:18,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:51:18,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:51:18,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:18" (1/1) ... [2022-11-18 20:51:18,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:51:18,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:51:18,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:51:18,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:51:18,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:51:18,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 20:51:18,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:51:18,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:51:18,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:51:18,579 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 20:51:18,579 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 20:51:18,579 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 20:51:18,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 20:51:18,580 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 20:51:18,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 20:51:18,580 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-18 20:51:18,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-18 20:51:18,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:51:18,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 20:51:18,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:51:18,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:51:18,583 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:51:18,780 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:51:18,782 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:51:19,304 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:51:19,462 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:51:19,462 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:51:19,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:19 BoogieIcfgContainer [2022-11-18 20:51:19,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:51:19,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:51:19,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:51:19,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:51:19,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:51:17" (1/3) ... [2022-11-18 20:51:19,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151d1f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:51:19, skipping insertion in model container [2022-11-18 20:51:19,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:18" (2/3) ... [2022-11-18 20:51:19,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151d1f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:51:19, skipping insertion in model container [2022-11-18 20:51:19,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:19" (3/3) ... [2022-11-18 20:51:19,476 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_power.oepc_pso.oepc_rmo.oepc.i [2022-11-18 20:51:19,499 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:51:19,499 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-18 20:51:19,499 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:51:19,599 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 20:51:19,639 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 20:51:19,655 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 149 transitions, 318 flow [2022-11-18 20:51:19,658 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 149 transitions, 318 flow [2022-11-18 20:51:19,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2022-11-18 20:51:19,725 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-11-18 20:51:19,726 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:51:19,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-18 20:51:19,735 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-11-18 20:51:26,408 INFO L134 LiptonReduction]: Checked pairs total: 10866 [2022-11-18 20:51:26,408 INFO L136 LiptonReduction]: Total number of compositions: 143 [2022-11-18 20:51:26,417 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 45 transitions, 110 flow [2022-11-18 20:51:26,804 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 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:51:26,823 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:51:26,829 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;@7423c9b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:51:26,829 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-18 20:51:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 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:51:26,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 20:51:26,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:26,856 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 20:51:26,857 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:51:26,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:26,862 INFO L85 PathProgramCache]: Analyzing trace with hash 626, now seen corresponding path program 1 times [2022-11-18 20:51:26,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:26,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308797199] [2022-11-18 20:51:26,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:26,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:27,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:51:27,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:27,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308797199] [2022-11-18 20:51:27,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308797199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:27,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:27,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 20:51:27,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514668264] [2022-11-18 20:51:27,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:27,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:51:27,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:27,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:51:27,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:51:27,097 INFO L87 Difference]: Start difference. First operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 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:51:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:27,320 INFO L93 Difference]: Finished difference Result 6074 states and 24532 transitions. [2022-11-18 20:51:27,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:51:27,325 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:51:27,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:27,409 INFO L225 Difference]: With dead ends: 6074 [2022-11-18 20:51:27,410 INFO L226 Difference]: Without dead ends: 6074 [2022-11-18 20:51:27,411 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:51:27,414 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:27,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:51:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2022-11-18 20:51:27,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 6074. [2022-11-18 20:51:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6074 states, 6069 states have (on average 4.042181578513758) internal successors, (24532), 6073 states have internal predecessors, (24532), 0 states have call successors, (0), 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:51:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6074 states to 6074 states and 24532 transitions. [2022-11-18 20:51:27,898 INFO L78 Accepts]: Start accepts. Automaton has 6074 states and 24532 transitions. Word has length 1 [2022-11-18 20:51:27,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:27,898 INFO L495 AbstractCegarLoop]: Abstraction has 6074 states and 24532 transitions. [2022-11-18 20:51:27,899 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:51:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 6074 states and 24532 transitions. [2022-11-18 20:51:27,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 20:51:27,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:27,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 20:51:27,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:51:27,900 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:51:27,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:27,901 INFO L85 PathProgramCache]: Analyzing trace with hash 617071, now seen corresponding path program 1 times [2022-11-18 20:51:27,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:27,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651243674] [2022-11-18 20:51:27,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:27,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:28,271 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:51:28,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:28,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651243674] [2022-11-18 20:51:28,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651243674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:28,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:28,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:51:28,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576699253] [2022-11-18 20:51:28,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:28,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:28,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:28,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:28,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:28,276 INFO L87 Difference]: Start difference. First operand 6074 states and 24532 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:28,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:28,534 INFO L93 Difference]: Finished difference Result 4962 states and 19815 transitions. [2022-11-18 20:51:28,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:28,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-18 20:51:28,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:28,580 INFO L225 Difference]: With dead ends: 4962 [2022-11-18 20:51:28,581 INFO L226 Difference]: Without dead ends: 4812 [2022-11-18 20:51:28,581 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:51:28,582 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:28,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 8 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:51:28,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2022-11-18 20:51:28,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4812. [2022-11-18 20:51:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4810 states have (on average 4.012474012474012) internal successors, (19300), 4811 states have internal predecessors, (19300), 0 states have call successors, (0), 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:51:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 19300 transitions. [2022-11-18 20:51:28,875 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 19300 transitions. Word has length 3 [2022-11-18 20:51:28,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:28,875 INFO L495 AbstractCegarLoop]: Abstraction has 4812 states and 19300 transitions. [2022-11-18 20:51:28,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:28,876 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 19300 transitions. [2022-11-18 20:51:28,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:51:28,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:28,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:28,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:51:28,887 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:51:28,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:28,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1311152531, now seen corresponding path program 1 times [2022-11-18 20:51:28,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:28,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512859529] [2022-11-18 20:51:28,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:28,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:29,585 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:51:29,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:29,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512859529] [2022-11-18 20:51:29,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512859529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:29,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:29,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:29,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171790630] [2022-11-18 20:51:29,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:29,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:51:29,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:29,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:51:29,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:51:29,589 INFO L87 Difference]: Start difference. First operand 4812 states and 19300 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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:51:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:30,148 INFO L93 Difference]: Finished difference Result 11214 states and 43822 transitions. [2022-11-18 20:51:30,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:51:30,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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:51:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:30,263 INFO L225 Difference]: With dead ends: 11214 [2022-11-18 20:51:30,264 INFO L226 Difference]: Without dead ends: 11214 [2022-11-18 20:51:30,264 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:51:30,265 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:30,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 18 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:51:30,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11214 states. [2022-11-18 20:51:30,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11214 to 7504. [2022-11-18 20:51:30,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7504 states, 7502 states have (on average 4.043988269794721) internal successors, (30338), 7503 states have internal predecessors, (30338), 0 states have call successors, (0), 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:51:30,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7504 states to 7504 states and 30338 transitions. [2022-11-18 20:51:30,774 INFO L78 Accepts]: Start accepts. Automaton has 7504 states and 30338 transitions. Word has length 12 [2022-11-18 20:51:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:30,775 INFO L495 AbstractCegarLoop]: Abstraction has 7504 states and 30338 transitions. [2022-11-18 20:51:30,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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:51:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 7504 states and 30338 transitions. [2022-11-18 20:51:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:51:30,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:30,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:30,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:51:30,781 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:51:30,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:30,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1311152512, now seen corresponding path program 1 times [2022-11-18 20:51:30,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:30,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208401800] [2022-11-18 20:51:30,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:30,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:31,608 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:51:31,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:31,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208401800] [2022-11-18 20:51:31,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208401800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:31,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:31,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:51:31,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766742186] [2022-11-18 20:51:31,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:31,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:51:31,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:31,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:51:31,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:51:31,610 INFO L87 Difference]: Start difference. First operand 7504 states and 30338 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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:51:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:32,021 INFO L93 Difference]: Finished difference Result 6754 states and 26423 transitions. [2022-11-18 20:51:32,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:51:32,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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:51:32,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:32,053 INFO L225 Difference]: With dead ends: 6754 [2022-11-18 20:51:32,053 INFO L226 Difference]: Without dead ends: 5518 [2022-11-18 20:51:32,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:51:32,055 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 62 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:32,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 46 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:51:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2022-11-18 20:51:32,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 5518. [2022-11-18 20:51:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5518 states, 5517 states have (on average 3.8825448613376836) internal successors, (21420), 5517 states have internal predecessors, (21420), 0 states have call successors, (0), 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:51:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5518 states to 5518 states and 21420 transitions. [2022-11-18 20:51:32,310 INFO L78 Accepts]: Start accepts. Automaton has 5518 states and 21420 transitions. Word has length 12 [2022-11-18 20:51:32,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:32,311 INFO L495 AbstractCegarLoop]: Abstraction has 5518 states and 21420 transitions. [2022-11-18 20:51:32,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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:51:32,311 INFO L276 IsEmpty]: Start isEmpty. Operand 5518 states and 21420 transitions. [2022-11-18 20:51:32,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 20:51:32,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:32,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:32,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:51:32,316 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:51:32,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:32,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1761855850, now seen corresponding path program 1 times [2022-11-18 20:51:32,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:32,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757824034] [2022-11-18 20:51:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:32,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:32,573 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:51:32,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:32,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757824034] [2022-11-18 20:51:32,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757824034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:32,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:32,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:51:32,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737129471] [2022-11-18 20:51:32,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:32,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:51:32,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:32,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:51:32,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:51:32,579 INFO L87 Difference]: Start difference. First operand 5518 states and 21420 transitions. Second operand has 5 states, 4 states have (on average 3.25) 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:51:32,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:32,956 INFO L93 Difference]: Finished difference Result 7678 states and 28588 transitions. [2022-11-18 20:51:32,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:51:32,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) 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:51:32,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:32,991 INFO L225 Difference]: With dead ends: 7678 [2022-11-18 20:51:32,991 INFO L226 Difference]: Without dead ends: 6438 [2022-11-18 20:51:32,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:51:32,993 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 70 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:32,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 24 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:51:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6438 states. [2022-11-18 20:51:33,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6438 to 5256. [2022-11-18 20:51:33,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5256 states, 5255 states have (on average 3.865271170313987) internal successors, (20312), 5255 states have internal predecessors, (20312), 0 states have call successors, (0), 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:51:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 20312 transitions. [2022-11-18 20:51:33,192 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 20312 transitions. Word has length 13 [2022-11-18 20:51:33,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:33,192 INFO L495 AbstractCegarLoop]: Abstraction has 5256 states and 20312 transitions. [2022-11-18 20:51:33,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) 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:51:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 20312 transitions. [2022-11-18 20:51:33,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 20:51:33,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:33,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:33,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:51:33,197 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:51:33,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:33,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2074954850, now seen corresponding path program 1 times [2022-11-18 20:51:33,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:33,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243899666] [2022-11-18 20:51:33,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:33,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:51:33,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:33,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243899666] [2022-11-18 20:51:33,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243899666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:33,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:33,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:51:33,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217361132] [2022-11-18 20:51:33,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:33,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:51:33,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:33,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:51:33,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:51:33,396 INFO L87 Difference]: Start difference. First operand 5256 states and 20312 transitions. Second operand has 5 states, 4 states have (on average 3.25) 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:51:33,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:33,761 INFO L93 Difference]: Finished difference Result 7266 states and 27034 transitions. [2022-11-18 20:51:33,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:51:33,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) 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:51:33,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:33,803 INFO L225 Difference]: With dead ends: 7266 [2022-11-18 20:51:33,804 INFO L226 Difference]: Without dead ends: 6198 [2022-11-18 20:51:33,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:51:33,809 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 79 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:33,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 19 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:51:33,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6198 states. [2022-11-18 20:51:34,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6198 to 5160. [2022-11-18 20:51:34,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5160 states, 5159 states have (on average 3.8519092847451057) internal successors, (19872), 5159 states have internal predecessors, (19872), 0 states have call successors, (0), 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:51:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5160 states to 5160 states and 19872 transitions. [2022-11-18 20:51:34,131 INFO L78 Accepts]: Start accepts. Automaton has 5160 states and 19872 transitions. Word has length 13 [2022-11-18 20:51:34,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:34,131 INFO L495 AbstractCegarLoop]: Abstraction has 5160 states and 19872 transitions. [2022-11-18 20:51:34,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) 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:51:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 5160 states and 19872 transitions. [2022-11-18 20:51:34,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:51:34,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:34,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:34,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:51:34,137 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:51:34,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:34,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1133111445, now seen corresponding path program 1 times [2022-11-18 20:51:34,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:34,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690891034] [2022-11-18 20:51:34,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:34,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:34,381 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:51:34,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:34,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690891034] [2022-11-18 20:51:34,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690891034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:34,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:34,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:51:34,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192650737] [2022-11-18 20:51:34,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:34,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:51:34,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:34,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:51:34,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:51:34,385 INFO L87 Difference]: Start difference. First operand 5160 states and 19872 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:34,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:34,704 INFO L93 Difference]: Finished difference Result 6352 states and 23638 transitions. [2022-11-18 20:51:34,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:51:34,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-18 20:51:34,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:34,737 INFO L225 Difference]: With dead ends: 6352 [2022-11-18 20:51:34,738 INFO L226 Difference]: Without dead ends: 5512 [2022-11-18 20:51:34,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:51:34,739 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 60 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:34,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 24 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:51:34,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5512 states. [2022-11-18 20:51:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5512 to 4120. [2022-11-18 20:51:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4120 states, 4119 states have (on average 3.8232580723476572) internal successors, (15748), 4119 states have internal predecessors, (15748), 0 states have call successors, (0), 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:51:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4120 states to 4120 states and 15748 transitions. [2022-11-18 20:51:34,897 INFO L78 Accepts]: Start accepts. Automaton has 4120 states and 15748 transitions. Word has length 14 [2022-11-18 20:51:34,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:34,898 INFO L495 AbstractCegarLoop]: Abstraction has 4120 states and 15748 transitions. [2022-11-18 20:51:34,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:34,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4120 states and 15748 transitions. [2022-11-18 20:51:34,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:51:34,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:34,904 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:51:34,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:51:34,904 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:51:34,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:34,905 INFO L85 PathProgramCache]: Analyzing trace with hash 66802769, now seen corresponding path program 1 times [2022-11-18 20:51:34,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:34,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328805621] [2022-11-18 20:51:34,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:34,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:35,094 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:51:35,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:35,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328805621] [2022-11-18 20:51:35,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328805621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:35,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:35,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:35,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676176776] [2022-11-18 20:51:35,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:35,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:35,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:35,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:35,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:35,099 INFO L87 Difference]: Start difference. First operand 4120 states and 15748 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 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:51:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:35,203 INFO L93 Difference]: Finished difference Result 2996 states and 10184 transitions. [2022-11-18 20:51:35,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:35,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 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:51:35,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:35,217 INFO L225 Difference]: With dead ends: 2996 [2022-11-18 20:51:35,217 INFO L226 Difference]: Without dead ends: 2996 [2022-11-18 20:51:35,218 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:51:35,219 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:35,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 8 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:51:35,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2022-11-18 20:51:35,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2996. [2022-11-18 20:51:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2996 states, 2995 states have (on average 3.4003338898163604) internal successors, (10184), 2995 states have internal predecessors, (10184), 0 states have call successors, (0), 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:51:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 10184 transitions. [2022-11-18 20:51:35,362 INFO L78 Accepts]: Start accepts. Automaton has 2996 states and 10184 transitions. Word has length 16 [2022-11-18 20:51:35,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:35,362 INFO L495 AbstractCegarLoop]: Abstraction has 2996 states and 10184 transitions. [2022-11-18 20:51:35,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 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:51:35,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 10184 transitions. [2022-11-18 20:51:35,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 20:51:35,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:35,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:35,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:51:35,371 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:51:35,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:35,372 INFO L85 PathProgramCache]: Analyzing trace with hash -492232101, now seen corresponding path program 1 times [2022-11-18 20:51:35,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:35,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590635137] [2022-11-18 20:51:35,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:35,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:35,617 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:51:35,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:35,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590635137] [2022-11-18 20:51:35,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590635137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:35,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:35,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:51:35,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182345159] [2022-11-18 20:51:35,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:35,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:51:35,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:35,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:51:35,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:51:35,620 INFO L87 Difference]: Start difference. First operand 2996 states and 10184 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:35,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:35,998 INFO L93 Difference]: Finished difference Result 5393 states and 17749 transitions. [2022-11-18 20:51:35,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:51:35,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-18 20:51:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:36,018 INFO L225 Difference]: With dead ends: 5393 [2022-11-18 20:51:36,019 INFO L226 Difference]: Without dead ends: 3778 [2022-11-18 20:51:36,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:51:36,020 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 66 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:36,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 23 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:51:36,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states. [2022-11-18 20:51:36,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 2706. [2022-11-18 20:51:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2705 states have (on average 3.300924214417745) internal successors, (8929), 2705 states have internal predecessors, (8929), 0 states have call successors, (0), 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:51:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 8929 transitions. [2022-11-18 20:51:36,149 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 8929 transitions. Word has length 18 [2022-11-18 20:51:36,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:36,150 INFO L495 AbstractCegarLoop]: Abstraction has 2706 states and 8929 transitions. [2022-11-18 20:51:36,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 8929 transitions. [2022-11-18 20:51:36,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-18 20:51:36,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:36,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:36,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:51:36,158 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:51:36,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:36,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1229342850, now seen corresponding path program 1 times [2022-11-18 20:51:36,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:36,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187241523] [2022-11-18 20:51:36,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:36,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:36,389 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:51:36,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:36,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187241523] [2022-11-18 20:51:36,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187241523] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:36,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:36,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:51:36,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183881481] [2022-11-18 20:51:36,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:36,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:51:36,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:36,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:51:36,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:51:36,393 INFO L87 Difference]: Start difference. First operand 2706 states and 8929 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:36,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:36,656 INFO L93 Difference]: Finished difference Result 4140 states and 13306 transitions. [2022-11-18 20:51:36,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:51:36,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-18 20:51:36,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:36,671 INFO L225 Difference]: With dead ends: 4140 [2022-11-18 20:51:36,672 INFO L226 Difference]: Without dead ends: 2676 [2022-11-18 20:51:36,672 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:51:36,673 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:36,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 22 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:51:36,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2022-11-18 20:51:36,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2346. [2022-11-18 20:51:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 2345 states have (on average 3.2063965884861405) internal successors, (7519), 2345 states have internal predecessors, (7519), 0 states have call successors, (0), 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:51:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 7519 transitions. [2022-11-18 20:51:36,763 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 7519 transitions. Word has length 19 [2022-11-18 20:51:36,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:36,763 INFO L495 AbstractCegarLoop]: Abstraction has 2346 states and 7519 transitions. [2022-11-18 20:51:36,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:36,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 7519 transitions. [2022-11-18 20:51:36,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-18 20:51:36,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:36,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:36,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:51:36,771 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:51:36,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:36,772 INFO L85 PathProgramCache]: Analyzing trace with hash -22724397, now seen corresponding path program 1 times [2022-11-18 20:51:36,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:36,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579516843] [2022-11-18 20:51:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:36,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:37,078 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:51:37,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:37,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579516843] [2022-11-18 20:51:37,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579516843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:37,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:37,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:51:37,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642229782] [2022-11-18 20:51:37,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:37,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:51:37,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:37,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:51:37,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:51:37,082 INFO L87 Difference]: Start difference. First operand 2346 states and 7519 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:37,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:37,229 INFO L93 Difference]: Finished difference Result 1468 states and 4195 transitions. [2022-11-18 20:51:37,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:51:37,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-18 20:51:37,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:37,235 INFO L225 Difference]: With dead ends: 1468 [2022-11-18 20:51:37,235 INFO L226 Difference]: Without dead ends: 1468 [2022-11-18 20:51:37,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:51:37,236 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:37,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 12 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:51:37,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2022-11-18 20:51:37,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1468. [2022-11-18 20:51:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1467 states have (on average 2.859577368779823) internal successors, (4195), 1467 states have internal predecessors, (4195), 0 states have call successors, (0), 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:51:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 4195 transitions. [2022-11-18 20:51:37,286 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 4195 transitions. Word has length 19 [2022-11-18 20:51:37,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:37,286 INFO L495 AbstractCegarLoop]: Abstraction has 1468 states and 4195 transitions. [2022-11-18 20:51:37,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 4195 transitions. [2022-11-18 20:51:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 20:51:37,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:37,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:37,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:51:37,292 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:51:37,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:37,293 INFO L85 PathProgramCache]: Analyzing trace with hash -551436406, now seen corresponding path program 1 times [2022-11-18 20:51:37,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:37,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988398020] [2022-11-18 20:51:37,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:37,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:37,689 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:51:37,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:37,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988398020] [2022-11-18 20:51:37,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988398020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:37,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:37,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:51:37,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305052533] [2022-11-18 20:51:37,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:37,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:51:37,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:37,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:51:37,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:51:37,693 INFO L87 Difference]: Start difference. First operand 1468 states and 4195 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:37,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:37,858 INFO L93 Difference]: Finished difference Result 1126 states and 3217 transitions. [2022-11-18 20:51:37,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:51:37,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-18 20:51:37,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:37,862 INFO L225 Difference]: With dead ends: 1126 [2022-11-18 20:51:37,862 INFO L226 Difference]: Without dead ends: 1062 [2022-11-18 20:51:37,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:51:37,863 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 63 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:37,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 16 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:51:37,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2022-11-18 20:51:37,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2022-11-18 20:51:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1061 states have (on average 2.828463713477851) internal successors, (3001), 1061 states have internal predecessors, (3001), 0 states have call successors, (0), 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:51:37,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 3001 transitions. [2022-11-18 20:51:37,903 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 3001 transitions. Word has length 22 [2022-11-18 20:51:37,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:37,903 INFO L495 AbstractCegarLoop]: Abstraction has 1062 states and 3001 transitions. [2022-11-18 20:51:37,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 3001 transitions. [2022-11-18 20:51:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 20:51:37,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:37,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:37,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:51:37,909 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:51:37,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1997338383, now seen corresponding path program 1 times [2022-11-18 20:51:37,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:37,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908798311] [2022-11-18 20:51:37,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:37,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:38,275 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:51:38,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:38,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908798311] [2022-11-18 20:51:38,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908798311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:38,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:38,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:51:38,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96305552] [2022-11-18 20:51:38,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:38,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:51:38,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:38,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:51:38,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:51:38,279 INFO L87 Difference]: Start difference. First operand 1062 states and 3001 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:51:38,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:38,592 INFO L93 Difference]: Finished difference Result 1592 states and 4428 transitions. [2022-11-18 20:51:38,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:51:38,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-18 20:51:38,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:38,597 INFO L225 Difference]: With dead ends: 1592 [2022-11-18 20:51:38,597 INFO L226 Difference]: Without dead ends: 1321 [2022-11-18 20:51:38,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:51:38,599 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 53 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:38,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 16 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:51:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2022-11-18 20:51:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1040. [2022-11-18 20:51:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 1039 states have (on average 2.771896053897979) internal successors, (2880), 1039 states have internal predecessors, (2880), 0 states have call successors, (0), 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:51:38,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 2880 transitions. [2022-11-18 20:51:38,640 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 2880 transitions. Word has length 25 [2022-11-18 20:51:38,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:38,640 INFO L495 AbstractCegarLoop]: Abstraction has 1040 states and 2880 transitions. [2022-11-18 20:51:38,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:51:38,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 2880 transitions. [2022-11-18 20:51:38,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 20:51:38,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:38,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:38,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:51:38,646 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:51:38,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:38,646 INFO L85 PathProgramCache]: Analyzing trace with hash -545929, now seen corresponding path program 2 times [2022-11-18 20:51:38,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:38,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696712915] [2022-11-18 20:51:38,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:38,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:38,939 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:51:38,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:38,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696712915] [2022-11-18 20:51:38,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696712915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:38,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:38,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:51:38,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722100256] [2022-11-18 20:51:38,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:38,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:51:38,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:38,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:51:38,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:51:38,943 INFO L87 Difference]: Start difference. First operand 1040 states and 2880 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:51:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:39,163 INFO L93 Difference]: Finished difference Result 1434 states and 3892 transitions. [2022-11-18 20:51:39,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:51:39,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-18 20:51:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:39,166 INFO L225 Difference]: With dead ends: 1434 [2022-11-18 20:51:39,167 INFO L226 Difference]: Without dead ends: 958 [2022-11-18 20:51:39,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:51:39,168 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 41 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:39,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 20 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:51:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2022-11-18 20:51:39,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 952. [2022-11-18 20:51:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 951 states have (on average 2.6961093585699265) internal successors, (2564), 951 states have internal predecessors, (2564), 0 states have call successors, (0), 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:51:39,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2564 transitions. [2022-11-18 20:51:39,199 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 2564 transitions. Word has length 25 [2022-11-18 20:51:39,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:39,199 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 2564 transitions. [2022-11-18 20:51:39,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:51:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 2564 transitions. [2022-11-18 20:51:39,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 20:51:39,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:39,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:39,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:51:39,204 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:51:39,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:39,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1739464119, now seen corresponding path program 3 times [2022-11-18 20:51:39,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:39,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846036815] [2022-11-18 20:51:39,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:39,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:39,552 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:51:39,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:39,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846036815] [2022-11-18 20:51:39,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846036815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:39,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:39,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:51:39,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607306921] [2022-11-18 20:51:39,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:39,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:51:39,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:39,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:51:39,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:51:39,556 INFO L87 Difference]: Start difference. First operand 952 states and 2564 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:51:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:39,723 INFO L93 Difference]: Finished difference Result 892 states and 2450 transitions. [2022-11-18 20:51:39,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:51:39,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-18 20:51:39,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:39,725 INFO L225 Difference]: With dead ends: 892 [2022-11-18 20:51:39,725 INFO L226 Difference]: Without dead ends: 344 [2022-11-18 20:51:39,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:51:39,726 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 90 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:39,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 13 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:51:39,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-11-18 20:51:39,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2022-11-18 20:51:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 2.7434402332361514) internal successors, (941), 343 states have internal predecessors, (941), 0 states have call successors, (0), 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:51:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 941 transitions. [2022-11-18 20:51:39,737 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 941 transitions. Word has length 25 [2022-11-18 20:51:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:39,737 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 941 transitions. [2022-11-18 20:51:39,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:51:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 941 transitions. [2022-11-18 20:51:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:51:39,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:39,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:39,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:51:39,740 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:51:39,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:39,741 INFO L85 PathProgramCache]: Analyzing trace with hash -183319777, now seen corresponding path program 1 times [2022-11-18 20:51:39,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:39,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434517825] [2022-11-18 20:51:39,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:39,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:41,520 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:51:41,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:41,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434517825] [2022-11-18 20:51:41,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434517825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:41,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:41,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:51:41,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340142083] [2022-11-18 20:51:41,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:41,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:51:41,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:41,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:51:41,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:51:41,522 INFO L87 Difference]: Start difference. First operand 344 states and 941 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:41,861 INFO L93 Difference]: Finished difference Result 513 states and 1379 transitions. [2022-11-18 20:51:41,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:51:41,861 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-18 20:51:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:41,862 INFO L225 Difference]: With dead ends: 513 [2022-11-18 20:51:41,862 INFO L226 Difference]: Without dead ends: 294 [2022-11-18 20:51:41,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:51:41,863 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 50 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:41,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 39 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:51:41,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-18 20:51:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-11-18 20:51:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 2.6655290102389078) internal successors, (781), 293 states have internal predecessors, (781), 0 states have call successors, (0), 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:51:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 781 transitions. [2022-11-18 20:51:41,871 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 781 transitions. Word has length 29 [2022-11-18 20:51:41,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:41,872 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 781 transitions. [2022-11-18 20:51:41,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:41,872 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 781 transitions. [2022-11-18 20:51:41,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:51:41,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:41,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:41,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 20:51:41,874 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:51:41,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:41,875 INFO L85 PathProgramCache]: Analyzing trace with hash 637021161, now seen corresponding path program 2 times [2022-11-18 20:51:41,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:41,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847120414] [2022-11-18 20:51:41,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:41,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:42,988 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:51:42,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:42,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847120414] [2022-11-18 20:51:42,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847120414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:42,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:42,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:51:42,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266613591] [2022-11-18 20:51:42,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:42,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:51:42,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:42,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:51:42,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:51:42,990 INFO L87 Difference]: Start difference. First operand 294 states and 781 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:43,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:51:43,483 INFO L93 Difference]: Finished difference Result 447 states and 1140 transitions. [2022-11-18 20:51:43,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:51:43,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-18 20:51:43,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:51:43,484 INFO L225 Difference]: With dead ends: 447 [2022-11-18 20:51:43,484 INFO L226 Difference]: Without dead ends: 279 [2022-11-18 20:51:43,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:51:43,485 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 112 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:51:43,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 24 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:51:43,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-18 20:51:43,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 242. [2022-11-18 20:51:43,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.4522821576763487) internal successors, (591), 241 states have internal predecessors, (591), 0 states have call successors, (0), 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:51:43,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 591 transitions. [2022-11-18 20:51:43,495 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 591 transitions. Word has length 29 [2022-11-18 20:51:43,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:51:43,495 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 591 transitions. [2022-11-18 20:51:43,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:43,496 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 591 transitions. [2022-11-18 20:51:43,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:51:43,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:51:43,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:43,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 20:51:43,497 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:51:43,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:43,498 INFO L85 PathProgramCache]: Analyzing trace with hash 451359199, now seen corresponding path program 3 times [2022-11-18 20:51:43,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:43,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756023807] [2022-11-18 20:51:43,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:43,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:51:43,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:51:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:51:43,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:51:43,796 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:51:43,797 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-18 20:51:43,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-18 20:51:43,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-18 20:51:43,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-18 20:51:43,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-18 20:51:43,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-18 20:51:43,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-18 20:51:43,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-18 20:51:43,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-18 20:51:43,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-18 20:51:43,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-18 20:51:43,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-18 20:51:43,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-18 20:51:43,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-18 20:51:43,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-18 20:51:43,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-18 20:51:43,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 20:51:43,806 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:43,812 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 20:51:43,812 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:51:43,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:51:43 BasicIcfg [2022-11-18 20:51:43,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:51:43,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:51:43,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:51:43,920 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:51:43,921 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:19" (3/4) ... [2022-11-18 20:51:43,923 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 20:51:43,924 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:51:43,924 INFO L158 Benchmark]: Toolchain (without parser) took 26434.20ms. Allocated memory was 98.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 65.1MB in the beginning and 586.5MB in the end (delta: -521.4MB). Peak memory consumption was 905.8MB. Max. memory is 16.1GB. [2022-11-18 20:51:43,925 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 98.6MB. Free memory was 53.7MB in the beginning and 53.6MB in the end (delta: 43.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:51:43,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 877.00ms. Allocated memory is still 98.6MB. Free memory was 65.0MB in the beginning and 62.4MB in the end (delta: 2.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 20:51:43,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.59ms. Allocated memory is still 98.6MB. Free memory was 62.4MB in the beginning and 59.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:51:43,926 INFO L158 Benchmark]: Boogie Preprocessor took 48.60ms. Allocated memory is still 98.6MB. Free memory was 59.9MB in the beginning and 57.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:51:43,926 INFO L158 Benchmark]: RCFGBuilder took 983.74ms. Allocated memory was 98.6MB in the beginning and 127.9MB in the end (delta: 29.4MB). Free memory was 57.8MB in the beginning and 84.7MB in the end (delta: -26.9MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2022-11-18 20:51:43,927 INFO L158 Benchmark]: TraceAbstraction took 24451.22ms. Allocated memory was 127.9MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 83.4MB in the beginning and 587.6MB in the end (delta: -504.1MB). Peak memory consumption was 896.5MB. Max. memory is 16.1GB. [2022-11-18 20:51:43,927 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 1.5GB. Free memory was 587.6MB in the beginning and 586.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:51:43,929 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.30ms. Allocated memory is still 98.6MB. Free memory was 53.7MB in the beginning and 53.6MB in the end (delta: 43.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 877.00ms. Allocated memory is still 98.6MB. Free memory was 65.0MB in the beginning and 62.4MB in the end (delta: 2.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.59ms. Allocated memory is still 98.6MB. Free memory was 62.4MB in the beginning and 59.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.60ms. Allocated memory is still 98.6MB. Free memory was 59.9MB in the beginning and 57.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 983.74ms. Allocated memory was 98.6MB in the beginning and 127.9MB in the end (delta: 29.4MB). Free memory was 57.8MB in the beginning and 84.7MB in the end (delta: -26.9MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * TraceAbstraction took 24451.22ms. Allocated memory was 127.9MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 83.4MB in the beginning and 587.6MB in the end (delta: -504.1MB). Peak memory consumption was 896.5MB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 1.5GB. Free memory was 587.6MB in the beginning and 586.5MB in the end (delta: 1.0MB). 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: 6.8s, 160 PlacesBefore, 57 PlacesAfterwards, 149 TransitionsBefore, 45 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 143 TotalNumberOfCompositions, 10866 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6620, independent: 6390, independent conditional: 0, independent unconditional: 6390, dependent: 230, dependent conditional: 0, dependent unconditional: 230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2862, independent: 2801, independent conditional: 0, independent unconditional: 2801, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2862, independent: 2773, independent conditional: 0, independent unconditional: 2773, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 89, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 419, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 371, dependent conditional: 0, dependent unconditional: 371, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6620, independent: 3589, independent conditional: 0, independent unconditional: 3589, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 2862, unknown conditional: 0, unknown unconditional: 2862] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 372, Positive conditional cache size: 0, Positive unconditional cache size: 372, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: [L736] 0 _Bool a$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L720] 0 int a$mem_tmp; [L731] 0 _Bool a$read_delayed; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L729] 0 _Bool a$r_buff1_thd3; [L712] 0 int __unbuffered_p2_EAX = 0; [L730] 0 _Bool a$r_buff1_thd4; [L727] 0 _Bool a$r_buff1_thd1; [L733] 0 int a$w_buff0; [L728] 0 _Bool a$r_buff1_thd2; [L735] 0 int a$w_buff1; [L719] 0 _Bool a$flush_delayed; [L726] 0 _Bool a$r_buff1_thd0; [L710] 0 int __unbuffered_cnt = 0; [L732] 0 int *a$read_delayed_var; [L738] 0 _Bool main$tmp_guard1; [L737] 0 _Bool main$tmp_guard0; [L734] 0 _Bool a$w_buff0_used; [L722] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd0; [L714] 0 int __unbuffered_p3_EAX = 0; [L724] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd4; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L864] 0 pthread_t t553; [L865] FCALL, FORK 0 pthread_create(&t553, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t553, ((void *)0), P0, ((void *)0))=-4, t553={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L866] 0 pthread_t t554; [L867] FCALL, FORK 0 pthread_create(&t554, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t554, ((void *)0), P1, ((void *)0))=-3, t553={5:0}, t554={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L868] 0 pthread_t t555; [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L869] FCALL, FORK 0 pthread_create(&t555, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t555, ((void *)0), P2, ((void *)0))=-2, t553={5:0}, t554={6:0}, t555={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L870] 0 pthread_t t556; [L871] FCALL, FORK 0 pthread_create(&t556, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t556, ((void *)0), P3, ((void *)0))=-1, t553={5:0}, t554={6:0}, t555={7:0}, t556={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$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$$choice2=0, x=2, y=1, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$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$$choice2=0, x=2, y=1, z=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L800] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0: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$$choice2=0, x=2, y=2, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0: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$$choice2=0, x=2, y=2, z=0] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0: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$$choice2=0, x=2, y=2, z=0] [L820] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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$$choice2=0, x=2, y=2, z=1] [L823] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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$$choice2=0, x=2, y=2, z=1] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t553={5:0}, t554={6:0}, t555={7:0}, t556={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=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: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 869]: 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: 871]: 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: 867]: 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 9 procedures, 186 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 24.2s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 887 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 887 mSDsluCounter, 336 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 211 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2386 IncrementalHoareTripleChecker+Invalid, 2480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 125 mSDtfsCounter, 2386 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7504occurred in iteration=3, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 9048 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 2634 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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:51:43,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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_ec7494ea-aa70-4f93-9052-3181e4850edd/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 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc --- 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:51:46,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:51:46,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:51:46,405 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:51:46,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:51:46,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:51:46,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:51:46,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:51:46,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:51:46,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:51:46,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:51:46,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:51:46,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:51:46,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:51:46,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:51:46,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:51:46,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:51:46,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:51:46,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:51:46,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:51:46,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:51:46,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:51:46,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:51:46,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:51:46,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:51:46,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:51:46,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:51:46,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:51:46,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:51:46,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:51:46,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:51:46,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:51:46,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:51:46,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:51:46,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:51:46,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:51:46,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:51:46,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:51:46,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:51:46,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:51:46,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:51:46,453 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-18 20:51:46,479 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:51:46,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:51:46,481 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:51:46,481 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:51:46,482 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:51:46,482 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:51:46,483 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:51:46,484 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:51:46,484 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:51:46,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:51:46,485 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:51:46,485 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:51:46,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:51:46,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:51:46,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:51:46,486 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:51:46,487 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:51:46,487 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:51:46,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:51:46,488 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:51:46,488 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 20:51:46,488 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 20:51:46,489 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:51:46,489 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:51:46,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:51:46,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:51:46,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:51:46,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:51:46,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:51:46,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:51:46,492 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 20:51:46,492 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 20:51:46,493 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 20:51:46,493 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_ec7494ea-aa70-4f93-9052-3181e4850edd/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_ec7494ea-aa70-4f93-9052-3181e4850edd/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 -> 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc [2022-11-18 20:51:46,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:51:46,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:51:46,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:51:46,971 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:51:46,974 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:51:46,976 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2022-11-18 20:51:47,061 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/data/03de9fd69/3fc58aa21c8344fe919f6c8c5e396d04/FLAG46c3de7a6 [2022-11-18 20:51:47,725 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:51:47,726 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2022-11-18 20:51:47,748 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/data/03de9fd69/3fc58aa21c8344fe919f6c8c5e396d04/FLAG46c3de7a6 [2022-11-18 20:51:47,969 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/data/03de9fd69/3fc58aa21c8344fe919f6c8c5e396d04 [2022-11-18 20:51:47,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:51:47,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:51:47,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:51:47,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:51:47,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:51:47,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:51:47" (1/1) ... [2022-11-18 20:51:47,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc00ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:47, skipping insertion in model container [2022-11-18 20:51:47,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:51:47" (1/1) ... [2022-11-18 20:51:47,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:51:48,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:51:48,337 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_ec7494ea-aa70-4f93-9052-3181e4850edd/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-18 20:51:48,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:51:48,682 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:51:48,697 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_ec7494ea-aa70-4f93-9052-3181e4850edd/sv-benchmarks/c/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-18 20:51:48,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:51:48,786 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:51:48,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:48 WrapperNode [2022-11-18 20:51:48,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:51:48,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:51:48,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:51:48,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:51:48,796 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:51:48" (1/1) ... [2022-11-18 20:51:48,815 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:51:48" (1/1) ... [2022-11-18 20:51:48,843 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-11-18 20:51:48,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:51:48,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:51:48,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:51:48,844 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:51:48,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:48" (1/1) ... [2022-11-18 20:51:48,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:48" (1/1) ... [2022-11-18 20:51:48,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:48" (1/1) ... [2022-11-18 20:51:48,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:48" (1/1) ... [2022-11-18 20:51:48,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:48" (1/1) ... [2022-11-18 20:51:48,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:48" (1/1) ... [2022-11-18 20:51:48,892 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:48" (1/1) ... [2022-11-18 20:51:48,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:48" (1/1) ... [2022-11-18 20:51:48,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:51:48,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:51:48,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:51:48,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:51:48,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:48" (1/1) ... [2022-11-18 20:51:48,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:51:48,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:51:48,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:51:48,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:51:48,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 20:51:48,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:51:48,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:51:48,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:51:48,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-18 20:51:48,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 20:51:48,998 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 20:51:49,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 20:51:49,001 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 20:51:49,001 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 20:51:49,001 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 20:51:49,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 20:51:49,002 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-18 20:51:49,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-18 20:51:49,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 20:51:49,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:51:49,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:51:49,005 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:51:49,212 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:51:49,215 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:51:49,805 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:51:50,046 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:51:50,047 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:51:50,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:50 BoogieIcfgContainer [2022-11-18 20:51:50,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:51:50,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:51:50,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:51:50,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:51:50,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:51:47" (1/3) ... [2022-11-18 20:51:50,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f439ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:51:50, skipping insertion in model container [2022-11-18 20:51:50,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:48" (2/3) ... [2022-11-18 20:51:50,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f439ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:51:50, skipping insertion in model container [2022-11-18 20:51:50,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:50" (3/3) ... [2022-11-18 20:51:50,064 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_power.oepc_pso.oepc_rmo.oepc.i [2022-11-18 20:51:50,085 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:51:50,085 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-18 20:51:50,085 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:51:50,180 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 20:51:50,235 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 20:51:50,250 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 150 transitions, 320 flow [2022-11-18 20:51:50,253 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 150 transitions, 320 flow [2022-11-18 20:51:50,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 150 transitions, 320 flow [2022-11-18 20:51:50,330 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-11-18 20:51:50,331 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:51:50,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-18 20:51:50,340 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-11-18 20:52:00,785 INFO L134 LiptonReduction]: Checked pairs total: 10914 [2022-11-18 20:52:00,786 INFO L136 LiptonReduction]: Total number of compositions: 140 [2022-11-18 20:52:00,794 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 45 transitions, 110 flow [2022-11-18 20:52:01,176 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 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:52:01,199 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:52:01,207 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;@51b67ec0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:52:01,207 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-18 20:52:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 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:52:01,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 20:52:01,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:01,244 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 20:52:01,245 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:52:01,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:01,251 INFO L85 PathProgramCache]: Analyzing trace with hash 625, now seen corresponding path program 1 times [2022-11-18 20:52:01,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:52:01,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998938681] [2022-11-18 20:52:01,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:01,266 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:52:01,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:52:01,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:01,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:01,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 20:52:01,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:52:01,431 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:52:01,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:52:01,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:52:01,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [998938681] [2022-11-18 20:52:01,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [998938681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:01,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:01,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 20:52:01,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573692390] [2022-11-18 20:52:01,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:01,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:52:01,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:52:01,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:52:01,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:52:01,491 INFO L87 Difference]: Start difference. First operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 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:52:01,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:01,924 INFO L93 Difference]: Finished difference Result 6074 states and 24532 transitions. [2022-11-18 20:52:01,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:52:01,927 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:52:01,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:02,006 INFO L225 Difference]: With dead ends: 6074 [2022-11-18 20:52:02,006 INFO L226 Difference]: Without dead ends: 6074 [2022-11-18 20:52:02,007 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:52:02,010 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:02,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:52:02,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2022-11-18 20:52:02,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 6074. [2022-11-18 20:52:02,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6074 states, 6069 states have (on average 4.042181578513758) internal successors, (24532), 6073 states have internal predecessors, (24532), 0 states have call successors, (0), 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:52:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6074 states to 6074 states and 24532 transitions. [2022-11-18 20:52:02,503 INFO L78 Accepts]: Start accepts. Automaton has 6074 states and 24532 transitions. Word has length 1 [2022-11-18 20:52:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:02,504 INFO L495 AbstractCegarLoop]: Abstraction has 6074 states and 24532 transitions. [2022-11-18 20:52:02,505 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:52:02,507 INFO L276 IsEmpty]: Start isEmpty. Operand 6074 states and 24532 transitions. [2022-11-18 20:52:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 20:52:02,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:02,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 20:52:02,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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)] Ended with exit code 0 [2022-11-18 20:52:02,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:02,720 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:52:02,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:02,721 INFO L85 PathProgramCache]: Analyzing trace with hash 616173, now seen corresponding path program 1 times [2022-11-18 20:52:02,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:52:02,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053339910] [2022-11-18 20:52:02,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:02,722 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:52:02,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:52:02,724 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:02,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:02,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:52:02,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:52:02,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:52:02,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:52:02,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:52:02,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053339910] [2022-11-18 20:52:02,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053339910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:02,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:02,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:52:02,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994860523] [2022-11-18 20:52:02,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:02,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:02,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:52:02,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:02,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:03,000 INFO L87 Difference]: Start difference. First operand 6074 states and 24532 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:03,441 INFO L93 Difference]: Finished difference Result 4962 states and 19815 transitions. [2022-11-18 20:52:03,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:03,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-18 20:52:03,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:03,504 INFO L225 Difference]: With dead ends: 4962 [2022-11-18 20:52:03,505 INFO L226 Difference]: Without dead ends: 4812 [2022-11-18 20:52:03,505 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:52:03,507 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:03,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 8 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:52:03,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2022-11-18 20:52:03,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4812. [2022-11-18 20:52:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4810 states have (on average 4.012474012474012) internal successors, (19300), 4811 states have internal predecessors, (19300), 0 states have call successors, (0), 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:52:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 19300 transitions. [2022-11-18 20:52:04,023 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 19300 transitions. Word has length 3 [2022-11-18 20:52:04,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:04,024 INFO L495 AbstractCegarLoop]: Abstraction has 4812 states and 19300 transitions. [2022-11-18 20:52:04,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 19300 transitions. [2022-11-18 20:52:04,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:52:04,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:04,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:04,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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)] Ended with exit code 0 [2022-11-18 20:52:04,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:04,229 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:52:04,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:04,230 INFO L85 PathProgramCache]: Analyzing trace with hash -519179383, now seen corresponding path program 1 times [2022-11-18 20:52:04,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:52:04,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498650045] [2022-11-18 20:52:04,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:04,231 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:52:04,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:52:04,236 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:04,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:04,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:52:04,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:52:04,461 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:52:04,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:52:04,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:52:04,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498650045] [2022-11-18 20:52:04,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498650045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:04,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:04,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:52:04,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476764442] [2022-11-18 20:52:04,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:04,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:52:04,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:52:04,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:52:04,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:52:04,466 INFO L87 Difference]: Start difference. First operand 4812 states and 19300 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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:52:04,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:04,654 INFO L93 Difference]: Finished difference Result 3212 states and 11300 transitions. [2022-11-18 20:52:04,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:52:04,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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:52:04,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:04,696 INFO L225 Difference]: With dead ends: 3212 [2022-11-18 20:52:04,696 INFO L226 Difference]: Without dead ends: 3212 [2022-11-18 20:52:04,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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:52:04,698 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:04,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:52:04,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2022-11-18 20:52:04,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 3212. [2022-11-18 20:52:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 3210 states have (on average 3.520249221183801) internal successors, (11300), 3211 states have internal predecessors, (11300), 0 states have call successors, (0), 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:52:04,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 11300 transitions. [2022-11-18 20:52:04,887 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 11300 transitions. Word has length 12 [2022-11-18 20:52:04,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:04,888 INFO L495 AbstractCegarLoop]: Abstraction has 3212 states and 11300 transitions. [2022-11-18 20:52:04,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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:52:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 11300 transitions. [2022-11-18 20:52:04,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:52:04,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:04,897 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:52:04,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:05,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:05,117 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:52:05,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:05,117 INFO L85 PathProgramCache]: Analyzing trace with hash 216351227, now seen corresponding path program 1 times [2022-11-18 20:52:05,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:52:05,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700575622] [2022-11-18 20:52:05,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:05,118 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:52:05,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:52:05,122 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:05,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:05,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:52:05,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:52:05,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:52:05,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:52:05,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:52:05,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700575622] [2022-11-18 20:52:05,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [700575622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:05,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:05,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:05,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11334094] [2022-11-18 20:52:05,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:05,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:52:05,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:52:05,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:52:05,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:52:05,363 INFO L87 Difference]: Start difference. First operand 3212 states and 11300 transitions. Second operand has 4 states, 4 states have (on average 4.0) 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:52:05,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:05,673 INFO L93 Difference]: Finished difference Result 1692 states and 5220 transitions. [2022-11-18 20:52:05,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:52:05,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) 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:52:05,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:05,682 INFO L225 Difference]: With dead ends: 1692 [2022-11-18 20:52:05,682 INFO L226 Difference]: Without dead ends: 1692 [2022-11-18 20:52:05,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:52:05,684 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:05,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 16 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:52:05,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2022-11-18 20:52:05,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1692. [2022-11-18 20:52:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1690 states have (on average 3.088757396449704) internal successors, (5220), 1691 states have internal predecessors, (5220), 0 states have call successors, (0), 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:52:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 5220 transitions. [2022-11-18 20:52:05,746 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 5220 transitions. Word has length 16 [2022-11-18 20:52:05,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:05,747 INFO L495 AbstractCegarLoop]: Abstraction has 1692 states and 5220 transitions. [2022-11-18 20:52:05,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) 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:52:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 5220 transitions. [2022-11-18 20:52:05,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 20:52:05,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:05,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:05,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:05,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:05,964 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:52:05,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:05,965 INFO L85 PathProgramCache]: Analyzing trace with hash -701060052, now seen corresponding path program 1 times [2022-11-18 20:52:05,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:52:05,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171958579] [2022-11-18 20:52:05,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:05,965 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:52:05,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:52:05,966 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:05,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:06,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:52:06,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:52:06,195 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:52:06,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:52:06,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:52:06,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171958579] [2022-11-18 20:52:06,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171958579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:06,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:06,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:06,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78617564] [2022-11-18 20:52:06,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:06,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:06,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:52:06,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:06,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:06,200 INFO L87 Difference]: Start difference. First operand 1692 states and 5220 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:06,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:06,539 INFO L93 Difference]: Finished difference Result 1152 states and 3600 transitions. [2022-11-18 20:52:06,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:06,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-18 20:52:06,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:06,545 INFO L225 Difference]: With dead ends: 1152 [2022-11-18 20:52:06,545 INFO L226 Difference]: Without dead ends: 1152 [2022-11-18 20:52:06,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:06,547 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:06,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 36 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:52:06,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2022-11-18 20:52:06,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152. [2022-11-18 20:52:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1150 states have (on average 3.130434782608696) internal successors, (3600), 1151 states have internal predecessors, (3600), 0 states have call successors, (0), 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:52:06,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 3600 transitions. [2022-11-18 20:52:06,585 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 3600 transitions. Word has length 20 [2022-11-18 20:52:06,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:06,585 INFO L495 AbstractCegarLoop]: Abstraction has 1152 states and 3600 transitions. [2022-11-18 20:52:06,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:06,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 3600 transitions. [2022-11-18 20:52:06,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 20:52:06,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:06,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:06,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:06,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:06,802 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:52:06,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:06,802 INFO L85 PathProgramCache]: Analyzing trace with hash -258829605, now seen corresponding path program 1 times [2022-11-18 20:52:06,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:52:06,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778116683] [2022-11-18 20:52:06,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:06,803 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:52:06,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:52:06,806 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:06,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:06,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:52:06,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:52:07,072 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:52:07,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:52:07,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:52:07,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778116683] [2022-11-18 20:52:07,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778116683] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:07,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:07,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:52:07,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992911096] [2022-11-18 20:52:07,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:07,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:52:07,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:52:07,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:52:07,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:52:07,075 INFO L87 Difference]: Start difference. First operand 1152 states and 3600 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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:52:07,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:07,566 INFO L93 Difference]: Finished difference Result 1067 states and 3430 transitions. [2022-11-18 20:52:07,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:52:07,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-18 20:52:07,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:07,573 INFO L225 Difference]: With dead ends: 1067 [2022-11-18 20:52:07,573 INFO L226 Difference]: Without dead ends: 1067 [2022-11-18 20:52:07,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:52:07,575 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 55 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:07,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 64 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:52:07,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-11-18 20:52:07,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1067. [2022-11-18 20:52:07,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 1065 states have (on average 3.220657276995305) internal successors, (3430), 1066 states have internal predecessors, (3430), 0 states have call successors, (0), 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:52:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 3430 transitions. [2022-11-18 20:52:07,660 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 3430 transitions. Word has length 24 [2022-11-18 20:52:07,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:07,660 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 3430 transitions. [2022-11-18 20:52:07,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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:52:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 3430 transitions. [2022-11-18 20:52:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:52:07,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:07,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:07,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:07,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:07,879 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:52:07,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:07,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1548036139, now seen corresponding path program 1 times [2022-11-18 20:52:07,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:52:07,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991494333] [2022-11-18 20:52:07,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:07,881 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:52:07,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:52:07,882 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:07,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:08,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:52:08,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:52:08,108 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:52:08,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:52:08,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:52:08,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991494333] [2022-11-18 20:52:08,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991494333] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:08,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:08,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:52:08,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299681250] [2022-11-18 20:52:08,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:08,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:52:08,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:52:08,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:52:08,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:52:08,112 INFO L87 Difference]: Start difference. First operand 1067 states and 3430 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:08,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:08,326 INFO L93 Difference]: Finished difference Result 1575 states and 4976 transitions. [2022-11-18 20:52:08,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:52:08,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-18 20:52:08,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:08,336 INFO L225 Difference]: With dead ends: 1575 [2022-11-18 20:52:08,337 INFO L226 Difference]: Without dead ends: 1575 [2022-11-18 20:52:08,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:52:08,338 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:08,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 17 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:52:08,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2022-11-18 20:52:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1574. [2022-11-18 20:52:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1572 states have (on average 3.1653944020356235) internal successors, (4976), 1573 states have internal predecessors, (4976), 0 states have call successors, (0), 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:52:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 4976 transitions. [2022-11-18 20:52:08,409 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 4976 transitions. Word has length 29 [2022-11-18 20:52:08,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:08,410 INFO L495 AbstractCegarLoop]: Abstraction has 1574 states and 4976 transitions. [2022-11-18 20:52:08,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:08,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 4976 transitions. [2022-11-18 20:52:08,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:52:08,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:08,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:08,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:08,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:08,630 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:52:08,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:08,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1548036114, now seen corresponding path program 1 times [2022-11-18 20:52:08,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:52:08,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079656268] [2022-11-18 20:52:08,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:08,632 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:52:08,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:52:08,633 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:08,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:08,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-18 20:52:08,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:52:09,724 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:52:09,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:52:09,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:52:09,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079656268] [2022-11-18 20:52:09,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079656268] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:09,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:09,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:09,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525877007] [2022-11-18 20:52:09,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:09,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:52:09,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:52:09,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:52:09,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:52:09,726 INFO L87 Difference]: Start difference. First operand 1574 states and 4976 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:09,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:09,950 INFO L93 Difference]: Finished difference Result 2840 states and 8996 transitions. [2022-11-18 20:52:09,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:52:09,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-18 20:52:09,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:09,962 INFO L225 Difference]: With dead ends: 2840 [2022-11-18 20:52:09,963 INFO L226 Difference]: Without dead ends: 2501 [2022-11-18 20:52:09,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:52:09,964 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:09,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 41 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 43 Unchecked, 0.2s Time] [2022-11-18 20:52:09,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2022-11-18 20:52:10,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 1801. [2022-11-18 20:52:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1799 states have (on average 3.1172873818788216) internal successors, (5608), 1800 states have internal predecessors, (5608), 0 states have call successors, (0), 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:52:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 5608 transitions. [2022-11-18 20:52:10,045 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 5608 transitions. Word has length 29 [2022-11-18 20:52:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:10,046 INFO L495 AbstractCegarLoop]: Abstraction has 1801 states and 5608 transitions. [2022-11-18 20:52:10,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 5608 transitions. [2022-11-18 20:52:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:52:10,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:10,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:10,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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)] Forceful destruction successful, exit code 0 [2022-11-18 20:52:10,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:10,265 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:52:10,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:10,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1545524624, now seen corresponding path program 2 times [2022-11-18 20:52:10,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:52:10,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436888030] [2022-11-18 20:52:10,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:52:10,267 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:52:10,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:52:10,268 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:10,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:10,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 20:52:10,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:52:10,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-18 20:52:10,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:52:11,254 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:52:11,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:52:11,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:52:11,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436888030] [2022-11-18 20:52:11,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436888030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:11,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:11,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:11,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983595958] [2022-11-18 20:52:11,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:11,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:52:11,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:52:11,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:52:11,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:52:11,256 INFO L87 Difference]: Start difference. First operand 1801 states and 5608 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:11,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:11,471 INFO L93 Difference]: Finished difference Result 3067 states and 9628 transitions. [2022-11-18 20:52:11,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:52:11,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-18 20:52:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:11,483 INFO L225 Difference]: With dead ends: 3067 [2022-11-18 20:52:11,483 INFO L226 Difference]: Without dead ends: 2448 [2022-11-18 20:52:11,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:52:11,484 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:11,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 41 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2022-11-18 20:52:11,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2022-11-18 20:52:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 1885. [2022-11-18 20:52:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1883 states have (on average 3.1290493892724376) internal successors, (5892), 1884 states have internal predecessors, (5892), 0 states have call successors, (0), 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:52:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 5892 transitions. [2022-11-18 20:52:11,551 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 5892 transitions. Word has length 29 [2022-11-18 20:52:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:11,551 INFO L495 AbstractCegarLoop]: Abstraction has 1885 states and 5892 transitions. [2022-11-18 20:52:11,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 5892 transitions. [2022-11-18 20:52:11,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:52:11,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:11,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:11,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:11,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:11,773 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:52:11,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:11,773 INFO L85 PathProgramCache]: Analyzing trace with hash -287949255, now seen corresponding path program 2 times [2022-11-18 20:52:11,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:52:11,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069333628] [2022-11-18 20:52:11,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:52:11,774 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:52:11,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:52:11,776 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:11,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:11,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 20:52:11,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:52:11,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-18 20:52:11,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:52:12,228 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:52:12,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:52:12,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:52:12,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069333628] [2022-11-18 20:52:12,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069333628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:12,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:12,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:52:12,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717270677] [2022-11-18 20:52:12,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:12,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:52:12,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:52:12,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:52:12,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:52:12,231 INFO L87 Difference]: Start difference. First operand 1885 states and 5892 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:12,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:12,778 INFO L93 Difference]: Finished difference Result 3067 states and 9252 transitions. [2022-11-18 20:52:12,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:52:12,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-18 20:52:12,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:12,794 INFO L225 Difference]: With dead ends: 3067 [2022-11-18 20:52:12,794 INFO L226 Difference]: Without dead ends: 2920 [2022-11-18 20:52:12,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:52:12,795 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 63 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:12,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 52 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:52:12,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2022-11-18 20:52:12,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2063. [2022-11-18 20:52:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2063 states, 2061 states have (on average 3.1203299369238233) internal successors, (6431), 2062 states have internal predecessors, (6431), 0 states have call successors, (0), 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:52:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 6431 transitions. [2022-11-18 20:52:12,895 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 6431 transitions. Word has length 29 [2022-11-18 20:52:12,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:12,896 INFO L495 AbstractCegarLoop]: Abstraction has 2063 states and 6431 transitions. [2022-11-18 20:52:12,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 6431 transitions. [2022-11-18 20:52:12,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:52:12,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:12,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:12,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:13,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:13,117 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:52:13,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:13,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1275979429, now seen corresponding path program 3 times [2022-11-18 20:52:13,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:52:13,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823115365] [2022-11-18 20:52:13,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:52:13,119 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:52:13,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:52:13,121 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:13,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:13,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-18 20:52:13,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:52:13,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-18 20:52:13,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:52:13,703 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:52:13,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:52:13,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:52:13,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823115365] [2022-11-18 20:52:13,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823115365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:13,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:13,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:52:13,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123909508] [2022-11-18 20:52:13,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:13,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:52:13,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:52:13,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:52:13,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:52:13,706 INFO L87 Difference]: Start difference. First operand 2063 states and 6431 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:14,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:14,239 INFO L93 Difference]: Finished difference Result 2927 states and 8698 transitions. [2022-11-18 20:52:14,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:52:14,239 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-18 20:52:14,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:14,251 INFO L225 Difference]: With dead ends: 2927 [2022-11-18 20:52:14,251 INFO L226 Difference]: Without dead ends: 2759 [2022-11-18 20:52:14,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:52:14,252 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 83 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:14,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 51 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:52:14,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2022-11-18 20:52:14,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2027. [2022-11-18 20:52:14,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 2025 states have (on average 3.0987654320987654) internal successors, (6275), 2026 states have internal predecessors, (6275), 0 states have call successors, (0), 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:52:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 6275 transitions. [2022-11-18 20:52:14,352 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 6275 transitions. Word has length 29 [2022-11-18 20:52:14,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:14,353 INFO L495 AbstractCegarLoop]: Abstraction has 2027 states and 6275 transitions. [2022-11-18 20:52:14,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:14,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 6275 transitions. [2022-11-18 20:52:14,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:52:14,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:14,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:14,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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)] Forceful destruction successful, exit code 0 [2022-11-18 20:52:14,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:14,575 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:52:14,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:14,576 INFO L85 PathProgramCache]: Analyzing trace with hash 271821213, now seen corresponding path program 4 times [2022-11-18 20:52:14,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:52:14,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37571987] [2022-11-18 20:52:14,576 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:52:14,577 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:52:14,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:52:14,578 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:14,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:14,759 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:52:14,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:52:14,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:52:14,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:52:14,825 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:52:14,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:52:14,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:52:14,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37571987] [2022-11-18 20:52:14,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37571987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:14,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:14,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:52:14,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586307870] [2022-11-18 20:52:14,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:14,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:52:14,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:52:14,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:52:14,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:52:14,830 INFO L87 Difference]: Start difference. First operand 2027 states and 6275 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:15,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:15,097 INFO L93 Difference]: Finished difference Result 2822 states and 8621 transitions. [2022-11-18 20:52:15,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:52:15,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-18 20:52:15,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:15,110 INFO L225 Difference]: With dead ends: 2822 [2022-11-18 20:52:15,111 INFO L226 Difference]: Without dead ends: 2519 [2022-11-18 20:52:15,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:52:15,112 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 33 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:15,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 20 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:52:15,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2022-11-18 20:52:15,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 1824. [2022-11-18 20:52:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1822 states have (on average 3.088364434687157) internal successors, (5627), 1823 states have internal predecessors, (5627), 0 states have call successors, (0), 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:52:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 5627 transitions. [2022-11-18 20:52:15,185 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 5627 transitions. Word has length 29 [2022-11-18 20:52:15,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:15,186 INFO L495 AbstractCegarLoop]: Abstraction has 1824 states and 5627 transitions. [2022-11-18 20:52:15,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:15,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 5627 transitions. [2022-11-18 20:52:15,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:52:15,193 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:15,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:15,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:15,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:15,407 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:52:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:15,407 INFO L85 PathProgramCache]: Analyzing trace with hash 268653669, now seen corresponding path program 5 times [2022-11-18 20:52:15,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:52:15,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234178269] [2022-11-18 20:52:15,408 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:52:15,408 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:52:15,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:52:15,409 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:15,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:15,564 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 20:52:15,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:52:15,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-18 20:52:15,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:52:16,130 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:52:16,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:52:16,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:52:16,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234178269] [2022-11-18 20:52:16,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234178269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:52:16,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:52:16,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:52:16,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226906794] [2022-11-18 20:52:16,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:52:16,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:52:16,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:52:16,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:52:16,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:52:16,133 INFO L87 Difference]: Start difference. First operand 1824 states and 5627 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:16,704 INFO L93 Difference]: Finished difference Result 2092 states and 6317 transitions. [2022-11-18 20:52:16,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:52:16,705 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-18 20:52:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:16,712 INFO L225 Difference]: With dead ends: 2092 [2022-11-18 20:52:16,713 INFO L226 Difference]: Without dead ends: 1857 [2022-11-18 20:52:16,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:52:16,713 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 72 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:16,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 56 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:52:16,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2022-11-18 20:52:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1396. [2022-11-18 20:52:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1394 states have (on average 3.07532281205165) internal successors, (4287), 1395 states have internal predecessors, (4287), 0 states have call successors, (0), 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:52:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 4287 transitions. [2022-11-18 20:52:16,762 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 4287 transitions. Word has length 29 [2022-11-18 20:52:16,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:16,763 INFO L495 AbstractCegarLoop]: Abstraction has 1396 states and 4287 transitions. [2022-11-18 20:52:16,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:52:16,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 4287 transitions. [2022-11-18 20:52:16,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:52:16,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:16,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:16,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:16,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:16,982 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-18 20:52:16,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:16,982 INFO L85 PathProgramCache]: Analyzing trace with hash 9644639, now seen corresponding path program 6 times [2022-11-18 20:52:16,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:52:16,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582740241] [2022-11-18 20:52:16,983 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 20:52:16,983 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:52:16,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:52:16,985 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:17,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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 (15)] Waiting until timeout for monitored process [2022-11-18 20:52:17,173 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-11-18 20:52:17,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-18 20:52:17,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:52:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:52:17,346 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-18 20:52:17,346 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:52:17,347 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-18 20:52:17,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-18 20:52:17,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-18 20:52:17,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-18 20:52:17,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-18 20:52:17,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-18 20:52:17,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-18 20:52:17,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-18 20:52:17,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-18 20:52:17,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-18 20:52:17,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-18 20:52:17,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-18 20:52:17,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-18 20:52:17,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-18 20:52:17,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-18 20:52:17,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-18 20:52:17,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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 (15)] Forceful destruction successful, exit code 0 [2022-11-18 20:52:17,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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:52:17,573 INFO L444 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 20:52:17,578 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 20:52:17,579 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:52:17,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:52:17 BasicIcfg [2022-11-18 20:52:17,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:52:17,710 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:52:17,710 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:52:17,717 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:52:17,717 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:50" (3/4) ... [2022-11-18 20:52:17,720 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 20:52:17,720 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:52:17,721 INFO L158 Benchmark]: Toolchain (without parser) took 29743.68ms. Allocated memory was 60.8MB in the beginning and 570.4MB in the end (delta: 509.6MB). Free memory was 37.8MB in the beginning and 233.5MB in the end (delta: -195.6MB). Peak memory consumption was 314.9MB. Max. memory is 16.1GB. [2022-11-18 20:52:17,721 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 60.8MB. Free memory is still 43.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:52:17,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 805.48ms. Allocated memory is still 60.8MB. Free memory was 37.7MB in the beginning and 30.6MB in the end (delta: 7.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 20:52:17,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.16ms. Allocated memory is still 60.8MB. Free memory was 30.4MB in the beginning and 27.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:52:17,722 INFO L158 Benchmark]: Boogie Preprocessor took 54.49ms. Allocated memory was 60.8MB in the beginning and 88.1MB in the end (delta: 27.3MB). Free memory was 27.9MB in the beginning and 70.3MB in the end (delta: -42.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-11-18 20:52:17,722 INFO L158 Benchmark]: RCFGBuilder took 1151.68ms. Allocated memory is still 88.1MB. Free memory was 70.3MB in the beginning and 52.5MB in the end (delta: 17.8MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2022-11-18 20:52:17,723 INFO L158 Benchmark]: TraceAbstraction took 27642.32ms. Allocated memory was 88.1MB in the beginning and 570.4MB in the end (delta: 482.3MB). Free memory was 51.5MB in the beginning and 233.5MB in the end (delta: -182.0MB). Peak memory consumption was 299.3MB. Max. memory is 16.1GB. [2022-11-18 20:52:17,723 INFO L158 Benchmark]: Witness Printer took 10.00ms. Allocated memory is still 570.4MB. Free memory is still 233.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:52:17,725 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.28ms. Allocated memory is still 60.8MB. Free memory is still 43.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 805.48ms. Allocated memory is still 60.8MB. Free memory was 37.7MB in the beginning and 30.6MB in the end (delta: 7.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.16ms. Allocated memory is still 60.8MB. Free memory was 30.4MB in the beginning and 27.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.49ms. Allocated memory was 60.8MB in the beginning and 88.1MB in the end (delta: 27.3MB). Free memory was 27.9MB in the beginning and 70.3MB in the end (delta: -42.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1151.68ms. Allocated memory is still 88.1MB. Free memory was 70.3MB in the beginning and 52.5MB in the end (delta: 17.8MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * TraceAbstraction took 27642.32ms. Allocated memory was 88.1MB in the beginning and 570.4MB in the end (delta: 482.3MB). Free memory was 51.5MB in the beginning and 233.5MB in the end (delta: -182.0MB). Peak memory consumption was 299.3MB. Max. memory is 16.1GB. * Witness Printer took 10.00ms. Allocated memory is still 570.4MB. Free memory is still 233.5MB. 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: 10.5s, 161 PlacesBefore, 57 PlacesAfterwards, 150 TransitionsBefore, 45 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 140 TotalNumberOfCompositions, 10914 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6533, independent: 6303, independent conditional: 0, independent unconditional: 6303, dependent: 230, dependent conditional: 0, dependent unconditional: 230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2846, independent: 2785, independent conditional: 0, independent unconditional: 2785, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2846, independent: 2757, independent conditional: 0, independent unconditional: 2757, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 89, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 519, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 452, dependent conditional: 0, dependent unconditional: 452, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6533, independent: 3518, independent conditional: 0, independent unconditional: 3518, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 2846, unknown conditional: 0, unknown unconditional: 2846] , Statistics on independence cache: Total cache size (in pairs): 395, Positive cache size: 366, Positive conditional cache size: 0, Positive unconditional cache size: 366, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: [L736] 0 _Bool a$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L720] 0 int a$mem_tmp; [L731] 0 _Bool a$read_delayed; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L729] 0 _Bool a$r_buff1_thd3; [L712] 0 int __unbuffered_p2_EAX = 0; [L730] 0 _Bool a$r_buff1_thd4; [L727] 0 _Bool a$r_buff1_thd1; [L733] 0 int a$w_buff0; [L728] 0 _Bool a$r_buff1_thd2; [L735] 0 int a$w_buff1; [L719] 0 _Bool a$flush_delayed; [L726] 0 _Bool a$r_buff1_thd0; [L710] 0 int __unbuffered_cnt = 0; [L732] 0 int *a$read_delayed_var; [L738] 0 _Bool main$tmp_guard1; [L737] 0 _Bool main$tmp_guard0; [L734] 0 _Bool a$w_buff0_used; [L722] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd0; [L714] 0 int __unbuffered_p3_EAX = 0; [L724] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd4; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L864] 0 pthread_t t553; [L865] FCALL, FORK 0 pthread_create(&t553, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t553, ((void *)0), P0, ((void *)0))=0, t553={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t554; [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] FCALL, FORK 0 pthread_create(&t554, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t554, ((void *)0), P1, ((void *)0))=1, t553={11:0}, t554={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t555; [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L869] FCALL, FORK 0 pthread_create(&t555, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t555, ((void *)0), P2, ((void *)0))=2, t553={11:0}, t554={15:0}, t555={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L870] 0 pthread_t t556; [L871] FCALL, FORK 0 pthread_create(&t556, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t556, ((void *)0), P3, ((void *)0))=3, t553={11:0}, t554={15:0}, t555={7:0}, t556={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$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$$choice2=0, x=2, y=1, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$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$$choice2=0, x=2, y=1, z=0] [L800] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0: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$$choice2=0, x=2, y=2, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0: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$$choice2=0, x=2, y=2, z=0] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0: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$$choice2=0, x=2, y=2, z=0] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L820] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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$$choice2=0, x=2, y=2, z=1] [L823] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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$$choice2=0, x=2, y=2, z=1] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=1] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t553={11:0}, t554={15:0}, t555={7:0}, t556={-2147483637:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=1] [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=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: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 869]: 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: 871]: 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: 867]: 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 9 procedures, 187 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 27.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 460 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 460 mSDsluCounter, 414 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 89 IncrementalHoareTripleChecker+Unchecked, 296 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2094 IncrementalHoareTripleChecker+Invalid, 2242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 118 mSDtfsCounter, 2094 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6448occurred in iteration=0, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 4009 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 266 ConstructedInterpolants, 37 QuantifiedInterpolants, 3840 SizeOfPredicates, 22 NumberOfNonLiveVariables, 2107 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:52:17,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec7494ea-aa70-4f93-9052-3181e4850edd/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