./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN --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 a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 --- 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-6b4ec56 [2022-11-20 10:57:18,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:57:18,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:57:18,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:57:18,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:57:18,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:57:18,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:57:18,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:57:18,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:57:18,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:57:18,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:57:18,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:57:18,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:57:18,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:57:18,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:57:18,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:57:18,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:57:18,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:57:18,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:57:18,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:57:18,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:57:18,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:57:18,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:57:18,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:57:18,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:57:18,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:57:18,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:57:18,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:57:18,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:57:18,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:57:18,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:57:18,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:57:18,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:57:18,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:57:18,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:57:18,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:57:18,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:57:18,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:57:18,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:57:18,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:57:18,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:57:18,951 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 10:57:18,994 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:57:18,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:57:18,995 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:57:18,996 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:57:18,997 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:57:18,997 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:57:18,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:57:18,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:57:18,998 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:57:18,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:57:19,000 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:57:19,001 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:57:19,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:57:19,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:57:19,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:57:19,002 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 10:57:19,002 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 10:57:19,002 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 10:57:19,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:57:19,003 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:57:19,003 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:57:19,003 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:57:19,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:57:19,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:57:19,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:57:19,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:57:19,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:57:19,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:57:19,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:57:19,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:57:19,006 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_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN 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 -> a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 [2022-11-20 10:57:19,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:57:19,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:57:19,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:57:19,389 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:57:19,390 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:57:19,391 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-20 10:57:22,517 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:57:22,759 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:57:22,760 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-20 10:57:22,784 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/data/b675ac23c/4895cbd1bcf64fa798a9c7983c603287/FLAGe520d91ed [2022-11-20 10:57:22,802 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/data/b675ac23c/4895cbd1bcf64fa798a9c7983c603287 [2022-11-20 10:57:22,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:57:22,811 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:57:22,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:57:22,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:57:22,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:57:22,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:57:22" (1/1) ... [2022-11-20 10:57:22,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a2c6762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:22, skipping insertion in model container [2022-11-20 10:57:22,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:57:22" (1/1) ... [2022-11-20 10:57:22,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:57:22,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:57:23,050 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-20 10:57:23,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:57:23,315 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:57:23,330 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-20 10:57:23,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:57:23,451 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:57:23,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:23 WrapperNode [2022-11-20 10:57:23,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:57:23,453 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:57:23,453 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:57:23,453 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:57:23,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:23" (1/1) ... [2022-11-20 10:57:23,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:23" (1/1) ... [2022-11-20 10:57:23,508 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 157 [2022-11-20 10:57:23,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:57:23,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:57:23,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:57:23,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:57:23,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:23" (1/1) ... [2022-11-20 10:57:23,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:23" (1/1) ... [2022-11-20 10:57:23,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:23" (1/1) ... [2022-11-20 10:57:23,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:23" (1/1) ... [2022-11-20 10:57:23,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:23" (1/1) ... [2022-11-20 10:57:23,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:23" (1/1) ... [2022-11-20 10:57:23,538 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:23" (1/1) ... [2022-11-20 10:57:23,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:23" (1/1) ... [2022-11-20 10:57:23,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:57:23,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:57:23,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:57:23,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:57:23,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:23" (1/1) ... [2022-11-20 10:57:23,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:57:23,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:57:23,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:57:23,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:57:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:57:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 10:57:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:57:23,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:57:23,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:57:23,652 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 10:57:23,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 10:57:23,652 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 10:57:23,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 10:57:23,653 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 10:57:23,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 10:57:23,654 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-20 10:57:23,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-20 10:57:23,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:57:23,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 10:57:23,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:57:23,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:57:23,657 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 10:57:23,856 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:57:23,858 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:57:24,320 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:57:24,566 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:57:24,567 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:57:24,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:57:24 BoogieIcfgContainer [2022-11-20 10:57:24,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:57:24,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:57:24,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:57:24,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:57:24,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:57:22" (1/3) ... [2022-11-20 10:57:24,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53aa0b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:57:24, skipping insertion in model container [2022-11-20 10:57:24,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:23" (2/3) ... [2022-11-20 10:57:24,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53aa0b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:57:24, skipping insertion in model container [2022-11-20 10:57:24,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:57:24" (3/3) ... [2022-11-20 10:57:24,578 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-20 10:57:24,599 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:57:24,599 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-20 10:57:24,599 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:57:24,682 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 10:57:24,748 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 10:57:24,765 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 144 transitions, 308 flow [2022-11-20 10:57:24,769 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 144 transitions, 308 flow [2022-11-20 10:57:24,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 308 flow [2022-11-20 10:57:24,843 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2022-11-20 10:57:24,844 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:57:24,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2022-11-20 10:57:24,855 INFO L119 LiptonReduction]: Number of co-enabled transitions 3262 [2022-11-20 10:57:32,936 INFO L134 LiptonReduction]: Checked pairs total: 8212 [2022-11-20 10:57:32,937 INFO L136 LiptonReduction]: Total number of compositions: 132 [2022-11-20 10:57:32,947 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 54 places, 42 transitions, 104 flow [2022-11-20 10:57:33,163 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3444 states, 3431 states have (on average 4.0104925677645005) internal successors, (13760), 3443 states have internal predecessors, (13760), 0 states have call successors, (0), 0 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-20 10:57:33,190 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:57:33,199 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;@e8aa47b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:57:33,199 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-20 10:57:33,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 3444 states, 3431 states have (on average 4.0104925677645005) internal successors, (13760), 3443 states have internal predecessors, (13760), 0 states have call successors, (0), 0 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-20 10:57:33,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 10:57:33,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:33,217 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 10:57:33,218 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:33,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:33,226 INFO L85 PathProgramCache]: Analyzing trace with hash 585, now seen corresponding path program 1 times [2022-11-20 10:57:33,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:33,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232062093] [2022-11-20 10:57:33,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:33,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:33,366 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-20 10:57:33,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:33,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232062093] [2022-11-20 10:57:33,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232062093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:33,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:33,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 10:57:33,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431070675] [2022-11-20 10:57:33,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:33,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:57:33,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:33,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:57:33,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:57:33,414 INFO L87 Difference]: Start difference. First operand has 3444 states, 3431 states have (on average 4.0104925677645005) internal successors, (13760), 3443 states have internal predecessors, (13760), 0 states have call successors, (0), 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-20 10:57:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:33,549 INFO L93 Difference]: Finished difference Result 3242 states and 12656 transitions. [2022-11-20 10:57:33,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:57:33,552 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-20 10:57:33,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:33,610 INFO L225 Difference]: With dead ends: 3242 [2022-11-20 10:57:33,611 INFO L226 Difference]: Without dead ends: 3242 [2022-11-20 10:57:33,612 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-20 10:57:33,616 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:33,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:57:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2022-11-20 10:57:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 3242. [2022-11-20 10:57:33,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3242 states, 3237 states have (on average 3.909793018226753) internal successors, (12656), 3241 states have internal predecessors, (12656), 0 states have call successors, (0), 0 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-20 10:57:33,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3242 states to 3242 states and 12656 transitions. [2022-11-20 10:57:33,914 INFO L78 Accepts]: Start accepts. Automaton has 3242 states and 12656 transitions. Word has length 1 [2022-11-20 10:57:33,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:33,914 INFO L495 AbstractCegarLoop]: Abstraction has 3242 states and 12656 transitions. [2022-11-20 10:57:33,915 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-20 10:57:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3242 states and 12656 transitions. [2022-11-20 10:57:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 10:57:33,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:33,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:33,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:57:33,918 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:33,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:33,918 INFO L85 PathProgramCache]: Analyzing trace with hash 950317624, now seen corresponding path program 1 times [2022-11-20 10:57:33,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:33,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657086669] [2022-11-20 10:57:33,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:33,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:34,428 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-20 10:57:34,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:34,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657086669] [2022-11-20 10:57:34,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657086669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:34,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:34,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 10:57:34,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996031062] [2022-11-20 10:57:34,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:34,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:57:34,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:34,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:57:34,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:57:34,439 INFO L87 Difference]: Start difference. First operand 3242 states and 12656 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:57:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:34,576 INFO L93 Difference]: Finished difference Result 2682 states and 10328 transitions. [2022-11-20 10:57:34,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:57:34,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 10:57:34,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:34,599 INFO L225 Difference]: With dead ends: 2682 [2022-11-20 10:57:34,605 INFO L226 Difference]: Without dead ends: 2602 [2022-11-20 10:57:34,606 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-20 10:57:34,607 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:34,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:57:34,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2022-11-20 10:57:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2022-11-20 10:57:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2602 states, 2600 states have (on average 3.870769230769231) internal successors, (10064), 2601 states have internal predecessors, (10064), 0 states have call successors, (0), 0 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-20 10:57:34,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2022-11-20 10:57:34,867 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2022-11-20 10:57:34,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:34,868 INFO L495 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2022-11-20 10:57:34,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:57:34,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2022-11-20 10:57:34,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 10:57:34,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:34,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:34,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:57:34,874 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:34,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:34,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1572700626, now seen corresponding path program 1 times [2022-11-20 10:57:34,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:34,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183614251] [2022-11-20 10:57:34,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:34,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:36,101 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-20 10:57:36,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:36,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183614251] [2022-11-20 10:57:36,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183614251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:36,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:36,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:57:36,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685022269] [2022-11-20 10:57:36,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:36,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:57:36,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:36,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:57:36,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:57:36,103 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:57:36,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:36,429 INFO L93 Difference]: Finished difference Result 4466 states and 16727 transitions. [2022-11-20 10:57:36,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:57:36,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 10:57:36,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:36,467 INFO L225 Difference]: With dead ends: 4466 [2022-11-20 10:57:36,468 INFO L226 Difference]: Without dead ends: 4466 [2022-11-20 10:57:36,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:57:36,469 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 33 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:36,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 11 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:57:36,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4466 states. [2022-11-20 10:57:36,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4466 to 2852. [2022-11-20 10:57:36,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2850 states have (on average 3.864561403508772) internal successors, (11014), 2851 states have internal predecessors, (11014), 0 states have call successors, (0), 0 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-20 10:57:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 11014 transitions. [2022-11-20 10:57:36,625 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 11014 transitions. Word has length 11 [2022-11-20 10:57:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:36,625 INFO L495 AbstractCegarLoop]: Abstraction has 2852 states and 11014 transitions. [2022-11-20 10:57:36,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:57:36,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 11014 transitions. [2022-11-20 10:57:36,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 10:57:36,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:36,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:36,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:57:36,629 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:36,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:36,630 INFO L85 PathProgramCache]: Analyzing trace with hash 980092630, now seen corresponding path program 1 times [2022-11-20 10:57:36,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:36,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768310365] [2022-11-20 10:57:36,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:36,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:37,401 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-20 10:57:37,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:37,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768310365] [2022-11-20 10:57:37,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768310365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:37,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:37,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:57:37,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641970720] [2022-11-20 10:57:37,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:37,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:57:37,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:37,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:57:37,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:57:37,404 INFO L87 Difference]: Start difference. First operand 2852 states and 11014 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-20 10:57:37,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:37,631 INFO L93 Difference]: Finished difference Result 4386 states and 16418 transitions. [2022-11-20 10:57:37,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:57:37,632 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-20 10:57:37,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:37,661 INFO L225 Difference]: With dead ends: 4386 [2022-11-20 10:57:37,662 INFO L226 Difference]: Without dead ends: 4386 [2022-11-20 10:57:37,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:57:37,663 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 39 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:37,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 7 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:57:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4386 states. [2022-11-20 10:57:37,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4386 to 2802. [2022-11-20 10:57:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2802 states, 2800 states have (on average 3.855) internal successors, (10794), 2801 states have internal predecessors, (10794), 0 states have call successors, (0), 0 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-20 10:57:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 10794 transitions. [2022-11-20 10:57:37,796 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 10794 transitions. Word has length 12 [2022-11-20 10:57:37,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:37,797 INFO L495 AbstractCegarLoop]: Abstraction has 2802 states and 10794 transitions. [2022-11-20 10:57:37,797 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-20 10:57:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 10794 transitions. [2022-11-20 10:57:37,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 10:57:37,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:37,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:37,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:57:37,800 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:37,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:37,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1509078134, now seen corresponding path program 1 times [2022-11-20 10:57:37,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:37,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762965094] [2022-11-20 10:57:37,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:37,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:38,562 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-20 10:57:38,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:38,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762965094] [2022-11-20 10:57:38,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762965094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:38,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:38,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:57:38,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341835691] [2022-11-20 10:57:38,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:38,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:57:38,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:38,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:57:38,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:57:38,565 INFO L87 Difference]: Start difference. First operand 2802 states and 10794 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-20 10:57:38,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:38,877 INFO L93 Difference]: Finished difference Result 2402 states and 9154 transitions. [2022-11-20 10:57:38,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:57:38,878 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-20 10:57:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:38,889 INFO L225 Difference]: With dead ends: 2402 [2022-11-20 10:57:38,890 INFO L226 Difference]: Without dead ends: 1962 [2022-11-20 10:57:38,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:57:38,891 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 48 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:38,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 70 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:57:38,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2022-11-20 10:57:38,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2022-11-20 10:57:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 3.6277409484956653) internal successors, (7114), 1961 states have internal predecessors, (7114), 0 states have call successors, (0), 0 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-20 10:57:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 7114 transitions. [2022-11-20 10:57:38,964 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 7114 transitions. Word has length 12 [2022-11-20 10:57:38,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:38,965 INFO L495 AbstractCegarLoop]: Abstraction has 1962 states and 7114 transitions. [2022-11-20 10:57:38,965 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-20 10:57:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 7114 transitions. [2022-11-20 10:57:38,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 10:57:38,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:38,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:38,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:57:38,968 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:38,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:38,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2060121723, now seen corresponding path program 1 times [2022-11-20 10:57:38,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:38,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966244949] [2022-11-20 10:57:38,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:38,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:57:39,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:39,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966244949] [2022-11-20 10:57:39,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966244949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:39,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:39,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:57:39,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140407098] [2022-11-20 10:57:39,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:39,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:57:39,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:39,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:57:39,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:57:39,529 INFO L87 Difference]: Start difference. First operand 1962 states and 7114 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-20 10:57:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:39,641 INFO L93 Difference]: Finished difference Result 2044 states and 7374 transitions. [2022-11-20 10:57:39,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:57:39,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-20 10:57:39,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:39,653 INFO L225 Difference]: With dead ends: 2044 [2022-11-20 10:57:39,653 INFO L226 Difference]: Without dead ends: 2044 [2022-11-20 10:57:39,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:57:39,655 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 24 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:39,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 12 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:57:39,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2022-11-20 10:57:39,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2010. [2022-11-20 10:57:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 2009 states have (on average 3.6152314584370333) internal successors, (7263), 2009 states have internal predecessors, (7263), 0 states have call successors, (0), 0 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-20 10:57:39,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 7263 transitions. [2022-11-20 10:57:39,731 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 7263 transitions. Word has length 13 [2022-11-20 10:57:39,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:39,731 INFO L495 AbstractCegarLoop]: Abstraction has 2010 states and 7263 transitions. [2022-11-20 10:57:39,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-20 10:57:39,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 7263 transitions. [2022-11-20 10:57:39,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 10:57:39,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:39,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:39,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:57:39,735 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:39,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:39,736 INFO L85 PathProgramCache]: Analyzing trace with hash -107026557, now seen corresponding path program 1 times [2022-11-20 10:57:39,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:39,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042151735] [2022-11-20 10:57:39,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:39,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:40,827 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-20 10:57:40,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:40,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042151735] [2022-11-20 10:57:40,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042151735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:40,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:40,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:57:40,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330416567] [2022-11-20 10:57:40,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:40,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:57:40,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:40,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:57:40,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:57:40,829 INFO L87 Difference]: Start difference. First operand 2010 states and 7263 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-20 10:57:41,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:41,166 INFO L93 Difference]: Finished difference Result 2852 states and 10251 transitions. [2022-11-20 10:57:41,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:57:41,167 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-20 10:57:41,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:41,184 INFO L225 Difference]: With dead ends: 2852 [2022-11-20 10:57:41,184 INFO L226 Difference]: Without dead ends: 2852 [2022-11-20 10:57:41,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:57:41,186 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:41,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 20 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:57:41,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2022-11-20 10:57:41,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2004. [2022-11-20 10:57:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 2003 states have (on average 3.6155766350474288) internal successors, (7242), 2003 states have internal predecessors, (7242), 0 states have call successors, (0), 0 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-20 10:57:41,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 7242 transitions. [2022-11-20 10:57:41,283 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 7242 transitions. Word has length 14 [2022-11-20 10:57:41,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:41,284 INFO L495 AbstractCegarLoop]: Abstraction has 2004 states and 7242 transitions. [2022-11-20 10:57:41,284 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-20 10:57:41,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 7242 transitions. [2022-11-20 10:57:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 10:57:41,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:41,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:41,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:57:41,288 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:41,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:41,289 INFO L85 PathProgramCache]: Analyzing trace with hash -563185175, now seen corresponding path program 1 times [2022-11-20 10:57:41,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:41,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275859882] [2022-11-20 10:57:41,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:41,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:42,462 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-20 10:57:42,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:42,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275859882] [2022-11-20 10:57:42,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275859882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:42,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:42,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:57:42,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510675923] [2022-11-20 10:57:42,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:42,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:57:42,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:42,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:57:42,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:57:42,465 INFO L87 Difference]: Start difference. First operand 2004 states and 7242 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-20 10:57:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:42,644 INFO L93 Difference]: Finished difference Result 2140 states and 7759 transitions. [2022-11-20 10:57:42,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:57:42,645 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-20 10:57:42,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:42,654 INFO L225 Difference]: With dead ends: 2140 [2022-11-20 10:57:42,654 INFO L226 Difference]: Without dead ends: 2140 [2022-11-20 10:57:42,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:57:42,655 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 39 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:42,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 14 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:57:42,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2022-11-20 10:57:42,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1928. [2022-11-20 10:57:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1928 states, 1927 states have (on average 3.6398546964193046) internal successors, (7014), 1927 states have internal predecessors, (7014), 0 states have call successors, (0), 0 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-20 10:57:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 7014 transitions. [2022-11-20 10:57:42,724 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 7014 transitions. Word has length 14 [2022-11-20 10:57:42,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:42,724 INFO L495 AbstractCegarLoop]: Abstraction has 1928 states and 7014 transitions. [2022-11-20 10:57:42,725 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-20 10:57:42,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 7014 transitions. [2022-11-20 10:57:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 10:57:42,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:42,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:42,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:57:42,728 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:42,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:42,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1699163231, now seen corresponding path program 2 times [2022-11-20 10:57:42,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:42,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233330444] [2022-11-20 10:57:42,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:42,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:43,151 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-20 10:57:43,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:43,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233330444] [2022-11-20 10:57:43,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233330444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:43,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:43,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:57:43,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831775180] [2022-11-20 10:57:43,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:43,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:57:43,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:43,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:57:43,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:57:43,160 INFO L87 Difference]: Start difference. First operand 1928 states and 7014 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-20 10:57:43,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:43,353 INFO L93 Difference]: Finished difference Result 1904 states and 6932 transitions. [2022-11-20 10:57:43,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:57:43,354 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-20 10:57:43,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:43,363 INFO L225 Difference]: With dead ends: 1904 [2022-11-20 10:57:43,363 INFO L226 Difference]: Without dead ends: 1904 [2022-11-20 10:57:43,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:57:43,366 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 35 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:43,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 16 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:57:43,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2022-11-20 10:57:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1844. [2022-11-20 10:57:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1843 states have (on average 3.643516006511123) internal successors, (6715), 1843 states have internal predecessors, (6715), 0 states have call successors, (0), 0 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-20 10:57:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 6715 transitions. [2022-11-20 10:57:43,431 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 6715 transitions. Word has length 14 [2022-11-20 10:57:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:43,432 INFO L495 AbstractCegarLoop]: Abstraction has 1844 states and 6715 transitions. [2022-11-20 10:57:43,432 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-20 10:57:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 6715 transitions. [2022-11-20 10:57:43,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 10:57:43,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:43,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:43,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:57:43,436 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:43,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:43,437 INFO L85 PathProgramCache]: Analyzing trace with hash 974694881, now seen corresponding path program 1 times [2022-11-20 10:57:43,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:43,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072757926] [2022-11-20 10:57:43,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:43,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:43,934 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-20 10:57:43,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:43,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072757926] [2022-11-20 10:57:43,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072757926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:43,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:43,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:57:43,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206060077] [2022-11-20 10:57:43,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:43,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:57:43,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:43,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:57:43,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:57:43,936 INFO L87 Difference]: Start difference. First operand 1844 states and 6715 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:57:44,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:44,103 INFO L93 Difference]: Finished difference Result 1916 states and 6963 transitions. [2022-11-20 10:57:44,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:57:44,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 10:57:44,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:44,112 INFO L225 Difference]: With dead ends: 1916 [2022-11-20 10:57:44,112 INFO L226 Difference]: Without dead ends: 1916 [2022-11-20 10:57:44,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:57:44,113 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:44,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 27 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:57:44,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2022-11-20 10:57:44,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1796. [2022-11-20 10:57:44,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1795 states have (on average 3.6116991643454037) internal successors, (6483), 1795 states have internal predecessors, (6483), 0 states have call successors, (0), 0 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-20 10:57:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 6483 transitions. [2022-11-20 10:57:44,174 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 6483 transitions. Word has length 15 [2022-11-20 10:57:44,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:44,174 INFO L495 AbstractCegarLoop]: Abstraction has 1796 states and 6483 transitions. [2022-11-20 10:57:44,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:57:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 6483 transitions. [2022-11-20 10:57:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 10:57:44,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:44,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:44,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:57:44,178 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:44,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:44,179 INFO L85 PathProgramCache]: Analyzing trace with hash 977141711, now seen corresponding path program 2 times [2022-11-20 10:57:44,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:44,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160533058] [2022-11-20 10:57:44,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:44,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:44,945 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-20 10:57:44,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:44,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160533058] [2022-11-20 10:57:44,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160533058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:44,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:44,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:57:44,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453934189] [2022-11-20 10:57:44,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:44,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:57:44,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:44,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:57:44,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:57:44,948 INFO L87 Difference]: Start difference. First operand 1796 states and 6483 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:57:45,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:45,203 INFO L93 Difference]: Finished difference Result 2104 states and 7599 transitions. [2022-11-20 10:57:45,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:57:45,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 10:57:45,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:45,218 INFO L225 Difference]: With dead ends: 2104 [2022-11-20 10:57:45,218 INFO L226 Difference]: Without dead ends: 2104 [2022-11-20 10:57:45,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:57:45,220 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:45,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 33 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:57:45,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2022-11-20 10:57:45,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 1750. [2022-11-20 10:57:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1749 states have (on average 3.5906232132647227) internal successors, (6280), 1749 states have internal predecessors, (6280), 0 states have call successors, (0), 0 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-20 10:57:45,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 6280 transitions. [2022-11-20 10:57:45,323 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 6280 transitions. Word has length 15 [2022-11-20 10:57:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:45,324 INFO L495 AbstractCegarLoop]: Abstraction has 1750 states and 6280 transitions. [2022-11-20 10:57:45,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:57:45,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 6280 transitions. [2022-11-20 10:57:45,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 10:57:45,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:45,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:45,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:57:45,339 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:45,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:45,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2003127254, now seen corresponding path program 1 times [2022-11-20 10:57:45,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:45,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332855907] [2022-11-20 10:57:45,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:45,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:57:46,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:46,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332855907] [2022-11-20 10:57:46,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332855907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:46,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:46,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:57:46,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486130607] [2022-11-20 10:57:46,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:46,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:57:46,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:46,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:57:46,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:57:46,145 INFO L87 Difference]: Start difference. First operand 1750 states and 6280 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 10:57:46,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:46,494 INFO L93 Difference]: Finished difference Result 1990 states and 7120 transitions. [2022-11-20 10:57:46,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:57:46,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 10:57:46,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:46,506 INFO L225 Difference]: With dead ends: 1990 [2022-11-20 10:57:46,507 INFO L226 Difference]: Without dead ends: 1990 [2022-11-20 10:57:46,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:57:46,508 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 83 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:46,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 18 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:57:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2022-11-20 10:57:46,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1878. [2022-11-20 10:57:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1877 states have (on average 3.6185402237613213) internal successors, (6792), 1877 states have internal predecessors, (6792), 0 states have call successors, (0), 0 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-20 10:57:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 6792 transitions. [2022-11-20 10:57:46,587 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 6792 transitions. Word has length 16 [2022-11-20 10:57:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:46,588 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 6792 transitions. [2022-11-20 10:57:46,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 10:57:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 6792 transitions. [2022-11-20 10:57:46,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 10:57:46,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:46,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:46,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:57:46,594 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:46,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:46,595 INFO L85 PathProgramCache]: Analyzing trace with hash 147218824, now seen corresponding path program 2 times [2022-11-20 10:57:46,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:46,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103143494] [2022-11-20 10:57:46,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:46,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:47,363 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-20 10:57:47,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:47,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103143494] [2022-11-20 10:57:47,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103143494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:47,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:47,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:57:47,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054304937] [2022-11-20 10:57:47,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:47,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:57:47,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:47,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:57:47,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:57:47,366 INFO L87 Difference]: Start difference. First operand 1878 states and 6792 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 10:57:47,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:47,575 INFO L93 Difference]: Finished difference Result 2230 states and 8088 transitions. [2022-11-20 10:57:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:57:47,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 10:57:47,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:47,586 INFO L225 Difference]: With dead ends: 2230 [2022-11-20 10:57:47,587 INFO L226 Difference]: Without dead ends: 2230 [2022-11-20 10:57:47,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:57:47,588 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 26 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:47,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 33 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:57:47,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2022-11-20 10:57:47,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 1990. [2022-11-20 10:57:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1989 states have (on average 3.6440422322775263) internal successors, (7248), 1989 states have internal predecessors, (7248), 0 states have call successors, (0), 0 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-20 10:57:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 7248 transitions. [2022-11-20 10:57:47,667 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 7248 transitions. Word has length 16 [2022-11-20 10:57:47,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:47,668 INFO L495 AbstractCegarLoop]: Abstraction has 1990 states and 7248 transitions. [2022-11-20 10:57:47,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 10:57:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 7248 transitions. [2022-11-20 10:57:47,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 10:57:47,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:47,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:47,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:57:47,673 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:47,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:47,674 INFO L85 PathProgramCache]: Analyzing trace with hash 226618504, now seen corresponding path program 3 times [2022-11-20 10:57:47,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:47,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429221321] [2022-11-20 10:57:47,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:47,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,551 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-20 10:57:48,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:48,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429221321] [2022-11-20 10:57:48,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429221321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:48,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:48,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:57:48,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536284601] [2022-11-20 10:57:48,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:48,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:57:48,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:48,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:57:48,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:57:48,554 INFO L87 Difference]: Start difference. First operand 1990 states and 7248 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 10:57:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:48,800 INFO L93 Difference]: Finished difference Result 2134 states and 7688 transitions. [2022-11-20 10:57:48,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:57:48,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 10:57:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:48,810 INFO L225 Difference]: With dead ends: 2134 [2022-11-20 10:57:48,810 INFO L226 Difference]: Without dead ends: 2134 [2022-11-20 10:57:48,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:57:48,811 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 80 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:48,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 22 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:57:48,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2022-11-20 10:57:48,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1974. [2022-11-20 10:57:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1974 states, 1973 states have (on average 3.645210339584389) internal successors, (7192), 1973 states have internal predecessors, (7192), 0 states have call successors, (0), 0 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-20 10:57:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 7192 transitions. [2022-11-20 10:57:48,873 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 7192 transitions. Word has length 16 [2022-11-20 10:57:48,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:48,874 INFO L495 AbstractCegarLoop]: Abstraction has 1974 states and 7192 transitions. [2022-11-20 10:57:48,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 10:57:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 7192 transitions. [2022-11-20 10:57:48,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 10:57:48,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:48,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:48,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:57:48,879 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:48,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:48,879 INFO L85 PathProgramCache]: Analyzing trace with hash -169642680, now seen corresponding path program 4 times [2022-11-20 10:57:48,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:48,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999201984] [2022-11-20 10:57:48,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:48,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,679 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-20 10:57:49,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:49,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999201984] [2022-11-20 10:57:49,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999201984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:49,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:49,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:57:49,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375716157] [2022-11-20 10:57:49,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:49,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:57:49,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:49,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:57:49,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:57:49,682 INFO L87 Difference]: Start difference. First operand 1974 states and 7192 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 10:57:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:49,926 INFO L93 Difference]: Finished difference Result 2322 states and 8210 transitions. [2022-11-20 10:57:49,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:57:49,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 10:57:49,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:49,938 INFO L225 Difference]: With dead ends: 2322 [2022-11-20 10:57:49,938 INFO L226 Difference]: Without dead ends: 1982 [2022-11-20 10:57:49,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:57:49,940 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 76 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:49,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 20 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:57:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2022-11-20 10:57:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1582. [2022-11-20 10:57:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 3.553447185325743) internal successors, (5618), 1581 states have internal predecessors, (5618), 0 states have call successors, (0), 0 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-20 10:57:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 5618 transitions. [2022-11-20 10:57:50,008 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 5618 transitions. Word has length 16 [2022-11-20 10:57:50,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:50,008 INFO L495 AbstractCegarLoop]: Abstraction has 1582 states and 5618 transitions. [2022-11-20 10:57:50,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-20 10:57:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 5618 transitions. [2022-11-20 10:57:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 10:57:50,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:50,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:50,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 10:57:50,014 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:50,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:50,015 INFO L85 PathProgramCache]: Analyzing trace with hash -158706314, now seen corresponding path program 1 times [2022-11-20 10:57:50,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:50,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118690974] [2022-11-20 10:57:50,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:50,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:50,216 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-20 10:57:50,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:50,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118690974] [2022-11-20 10:57:50,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118690974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:50,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:50,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:57:50,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626972729] [2022-11-20 10:57:50,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:50,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:57:50,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:50,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:57:50,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:57:50,224 INFO L87 Difference]: Start difference. First operand 1582 states and 5618 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-20 10:57:50,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:50,366 INFO L93 Difference]: Finished difference Result 1652 states and 5376 transitions. [2022-11-20 10:57:50,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:57:50,367 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-20 10:57:50,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:50,372 INFO L225 Difference]: With dead ends: 1652 [2022-11-20 10:57:50,372 INFO L226 Difference]: Without dead ends: 1252 [2022-11-20 10:57:50,372 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-20 10:57:50,373 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:50,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 20 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:57:50,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2022-11-20 10:57:50,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2022-11-20 10:57:50,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1251 states have (on average 3.216626698641087) internal successors, (4024), 1251 states have internal predecessors, (4024), 0 states have call successors, (0), 0 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-20 10:57:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 4024 transitions. [2022-11-20 10:57:50,408 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 4024 transitions. Word has length 16 [2022-11-20 10:57:50,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:50,409 INFO L495 AbstractCegarLoop]: Abstraction has 1252 states and 4024 transitions. [2022-11-20 10:57:50,409 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-20 10:57:50,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 4024 transitions. [2022-11-20 10:57:50,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 10:57:50,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:50,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:50,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 10:57:50,413 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:50,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:50,413 INFO L85 PathProgramCache]: Analyzing trace with hash -727987559, now seen corresponding path program 1 times [2022-11-20 10:57:50,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:50,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278943534] [2022-11-20 10:57:50,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:50,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:50,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-20 10:57:50,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:50,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278943534] [2022-11-20 10:57:50,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278943534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:50,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:50,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:57:50,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465005664] [2022-11-20 10:57:50,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:50,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:57:50,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:50,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:57:50,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:57:50,611 INFO L87 Difference]: Start difference. First operand 1252 states and 4024 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:57:50,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:50,777 INFO L93 Difference]: Finished difference Result 1093 states and 3261 transitions. [2022-11-20 10:57:50,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:57:50,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 10:57:50,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:50,782 INFO L225 Difference]: With dead ends: 1093 [2022-11-20 10:57:50,782 INFO L226 Difference]: Without dead ends: 837 [2022-11-20 10:57:50,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:57:50,783 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 62 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:50,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 28 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:57:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2022-11-20 10:57:50,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2022-11-20 10:57:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 2.9330143540669855) internal successors, (2452), 836 states have internal predecessors, (2452), 0 states have call successors, (0), 0 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-20 10:57:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 2452 transitions. [2022-11-20 10:57:50,806 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 2452 transitions. Word has length 17 [2022-11-20 10:57:50,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:50,807 INFO L495 AbstractCegarLoop]: Abstraction has 837 states and 2452 transitions. [2022-11-20 10:57:50,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:57:50,808 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 2452 transitions. [2022-11-20 10:57:50,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 10:57:50,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:50,810 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-20 10:57:50,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 10:57:50,811 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:50,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:50,811 INFO L85 PathProgramCache]: Analyzing trace with hash 784474132, now seen corresponding path program 1 times [2022-11-20 10:57:50,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:50,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126004005] [2022-11-20 10:57:50,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:50,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:51,597 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-20 10:57:51,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:51,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126004005] [2022-11-20 10:57:51,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126004005] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:51,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:51,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:57:51,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120592520] [2022-11-20 10:57:51,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:51,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:57:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:51,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:57:51,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:57:51,600 INFO L87 Difference]: Start difference. First operand 837 states and 2452 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-20 10:57:51,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:51,827 INFO L93 Difference]: Finished difference Result 1510 states and 4315 transitions. [2022-11-20 10:57:51,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:57:51,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-20 10:57:51,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:51,834 INFO L225 Difference]: With dead ends: 1510 [2022-11-20 10:57:51,834 INFO L226 Difference]: Without dead ends: 1173 [2022-11-20 10:57:51,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:57:51,836 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:51,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 13 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:57:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2022-11-20 10:57:51,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 827. [2022-11-20 10:57:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 826 states have (on average 2.7857142857142856) internal successors, (2301), 826 states have internal predecessors, (2301), 0 states have call successors, (0), 0 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-20 10:57:51,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 2301 transitions. [2022-11-20 10:57:51,877 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 2301 transitions. Word has length 18 [2022-11-20 10:57:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:51,877 INFO L495 AbstractCegarLoop]: Abstraction has 827 states and 2301 transitions. [2022-11-20 10:57:51,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-20 10:57:51,878 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 2301 transitions. [2022-11-20 10:57:51,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 10:57:51,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:51,882 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-20 10:57:51,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 10:57:51,882 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:51,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:51,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1765627265, now seen corresponding path program 1 times [2022-11-20 10:57:51,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:51,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453673422] [2022-11-20 10:57:51,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:51,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:52,136 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-20 10:57:52,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:52,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453673422] [2022-11-20 10:57:52,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453673422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:52,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:52,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:57:52,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873963627] [2022-11-20 10:57:52,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:52,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:57:52,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:52,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:57:52,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:57:52,141 INFO L87 Difference]: Start difference. First operand 827 states and 2301 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:57:52,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:52,359 INFO L93 Difference]: Finished difference Result 731 states and 2008 transitions. [2022-11-20 10:57:52,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:57:52,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 10:57:52,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:52,363 INFO L225 Difference]: With dead ends: 731 [2022-11-20 10:57:52,363 INFO L226 Difference]: Without dead ends: 627 [2022-11-20 10:57:52,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:57:52,364 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 74 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:52,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 34 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:57:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2022-11-20 10:57:52,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2022-11-20 10:57:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 626 states have (on average 2.7827476038338657) internal successors, (1742), 626 states have internal predecessors, (1742), 0 states have call successors, (0), 0 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-20 10:57:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 1742 transitions. [2022-11-20 10:57:52,384 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 1742 transitions. Word has length 19 [2022-11-20 10:57:52,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:52,385 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 1742 transitions. [2022-11-20 10:57:52,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:57:52,386 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 1742 transitions. [2022-11-20 10:57:52,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:57:52,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:52,389 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-20 10:57:52,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 10:57:52,389 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:52,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:52,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1107167177, now seen corresponding path program 1 times [2022-11-20 10:57:52,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:52,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082520132] [2022-11-20 10:57:52,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:52,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:53,276 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-20 10:57:53,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:53,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082520132] [2022-11-20 10:57:53,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082520132] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:53,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:53,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:57:53,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543832596] [2022-11-20 10:57:53,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:53,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:57:53,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:53,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:57:53,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:57:53,278 INFO L87 Difference]: Start difference. First operand 627 states and 1742 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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-20 10:57:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:53,731 INFO L93 Difference]: Finished difference Result 1103 states and 2946 transitions. [2022-11-20 10:57:53,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:57:53,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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-20 10:57:53,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:53,734 INFO L225 Difference]: With dead ends: 1103 [2022-11-20 10:57:53,734 INFO L226 Difference]: Without dead ends: 487 [2022-11-20 10:57:53,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:57:53,735 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:53,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 21 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:57:53,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-11-20 10:57:53,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 353. [2022-11-20 10:57:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 2.4204545454545454) internal successors, (852), 352 states have internal predecessors, (852), 0 states have call successors, (0), 0 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-20 10:57:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 852 transitions. [2022-11-20 10:57:53,747 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 852 transitions. Word has length 22 [2022-11-20 10:57:53,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:53,748 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 852 transitions. [2022-11-20 10:57:53,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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-20 10:57:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 852 transitions. [2022-11-20 10:57:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:57:53,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:53,750 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-20 10:57:53,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 10:57:53,752 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:53,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:53,753 INFO L85 PathProgramCache]: Analyzing trace with hash -157937803, now seen corresponding path program 1 times [2022-11-20 10:57:53,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:53,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472989744] [2022-11-20 10:57:53,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:53,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:57:54,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:54,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472989744] [2022-11-20 10:57:54,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472989744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:54,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:54,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:57:54,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048381046] [2022-11-20 10:57:54,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:54,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:57:54,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:54,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:57:54,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:57:54,072 INFO L87 Difference]: Start difference. First operand 353 states and 852 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:57:54,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:54,257 INFO L93 Difference]: Finished difference Result 332 states and 811 transitions. [2022-11-20 10:57:54,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:57:54,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 10:57:54,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:54,258 INFO L225 Difference]: With dead ends: 332 [2022-11-20 10:57:54,259 INFO L226 Difference]: Without dead ends: 159 [2022-11-20 10:57:54,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:57:54,260 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 81 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:54,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 19 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:57:54,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-20 10:57:54,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2022-11-20 10:57:54,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 2.310126582278481) internal successors, (365), 158 states have internal predecessors, (365), 0 states have call successors, (0), 0 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-20 10:57:54,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 365 transitions. [2022-11-20 10:57:54,265 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 365 transitions. Word has length 22 [2022-11-20 10:57:54,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:54,265 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 365 transitions. [2022-11-20 10:57:54,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:57:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 365 transitions. [2022-11-20 10:57:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 10:57:54,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:54,267 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-20 10:57:54,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 10:57:54,267 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:54,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:54,268 INFO L85 PathProgramCache]: Analyzing trace with hash -974024331, now seen corresponding path program 1 times [2022-11-20 10:57:54,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:54,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759902857] [2022-11-20 10:57:54,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:54,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:55,047 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-20 10:57:55,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:55,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759902857] [2022-11-20 10:57:55,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759902857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:55,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:55,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:57:55,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623676989] [2022-11-20 10:57:55,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:55,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:57:55,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:55,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:57:55,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:57:55,048 INFO L87 Difference]: Start difference. First operand 159 states and 365 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-20 10:57:55,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:55,174 INFO L93 Difference]: Finished difference Result 213 states and 485 transitions. [2022-11-20 10:57:55,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:57:55,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-20 10:57:55,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:55,176 INFO L225 Difference]: With dead ends: 213 [2022-11-20 10:57:55,176 INFO L226 Difference]: Without dead ends: 63 [2022-11-20 10:57:55,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:57:55,177 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:55,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 9 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:57:55,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-20 10:57:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-20 10:57:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 62 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-20 10:57:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 121 transitions. [2022-11-20 10:57:55,179 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 121 transitions. Word has length 25 [2022-11-20 10:57:55,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:55,179 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 121 transitions. [2022-11-20 10:57:55,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-20 10:57:55,180 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 121 transitions. [2022-11-20 10:57:55,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 10:57:55,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:55,181 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-20 10:57:55,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 10:57:55,181 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:57:55,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:55,182 INFO L85 PathProgramCache]: Analyzing trace with hash -919737617, now seen corresponding path program 2 times [2022-11-20 10:57:55,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:55,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136517542] [2022-11-20 10:57:55,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:55,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:57:55,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:57:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:57:55,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:57:55,332 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:57:55,333 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-20 10:57:55,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-20 10:57:55,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-20 10:57:55,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-20 10:57:55,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-20 10:57:55,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-20 10:57:55,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-20 10:57:55,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-20 10:57:55,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-20 10:57:55,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-20 10:57:55,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-20 10:57:55,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-20 10:57:55,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-20 10:57:55,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-20 10:57:55,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-20 10:57:55,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-20 10:57:55,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 10:57:55,345 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:55,352 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 10:57:55,352 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:57:55,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:57:55 BasicIcfg [2022-11-20 10:57:55,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:57:55,481 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:57:55,481 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:57:55,481 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:57:55,482 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:57:24" (3/4) ... [2022-11-20 10:57:55,485 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 10:57:55,485 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:57:55,486 INFO L158 Benchmark]: Toolchain (without parser) took 32674.59ms. Allocated memory was 186.6MB in the beginning and 761.3MB in the end (delta: 574.6MB). Free memory was 139.5MB in the beginning and 404.8MB in the end (delta: -265.3MB). Peak memory consumption was 311.8MB. Max. memory is 16.1GB. [2022-11-20 10:57:55,486 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 138.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:57:55,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 637.20ms. Allocated memory is still 186.6MB. Free memory was 139.5MB in the beginning and 116.5MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 10:57:55,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.96ms. Allocated memory is still 186.6MB. Free memory was 116.5MB in the beginning and 113.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:57:55,493 INFO L158 Benchmark]: Boogie Preprocessor took 51.26ms. Allocated memory is still 186.6MB. Free memory was 113.7MB in the beginning and 111.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:57:55,493 INFO L158 Benchmark]: RCFGBuilder took 1008.40ms. Allocated memory is still 186.6MB. Free memory was 111.6MB in the beginning and 149.2MB in the end (delta: -37.6MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2022-11-20 10:57:55,494 INFO L158 Benchmark]: TraceAbstraction took 30908.79ms. Allocated memory was 186.6MB in the beginning and 761.3MB in the end (delta: 574.6MB). Free memory was 148.2MB in the beginning and 405.9MB in the end (delta: -257.7MB). Peak memory consumption was 316.8MB. Max. memory is 16.1GB. [2022-11-20 10:57:55,496 INFO L158 Benchmark]: Witness Printer took 4.53ms. Allocated memory is still 761.3MB. Free memory was 405.9MB in the beginning and 404.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:57:55,502 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.32ms. Allocated memory is still 138.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 637.20ms. Allocated memory is still 186.6MB. Free memory was 139.5MB in the beginning and 116.5MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.96ms. Allocated memory is still 186.6MB. Free memory was 116.5MB in the beginning and 113.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.26ms. Allocated memory is still 186.6MB. Free memory was 113.7MB in the beginning and 111.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1008.40ms. Allocated memory is still 186.6MB. Free memory was 111.6MB in the beginning and 149.2MB in the end (delta: -37.6MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. * TraceAbstraction took 30908.79ms. Allocated memory was 186.6MB in the beginning and 761.3MB in the end (delta: 574.6MB). Free memory was 148.2MB in the beginning and 405.9MB in the end (delta: -257.7MB). Peak memory consumption was 316.8MB. Max. memory is 16.1GB. * Witness Printer took 4.53ms. Allocated memory is still 761.3MB. Free memory was 405.9MB in the beginning and 404.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.2s, 155 PlacesBefore, 54 PlacesAfterwards, 144 TransitionsBefore, 42 TransitionsAfterwards, 3262 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 132 TotalNumberOfCompositions, 8212 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4379, independent: 4183, independent conditional: 0, independent unconditional: 4183, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2369, independent: 2292, independent conditional: 0, independent unconditional: 2292, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2369, independent: 2253, independent conditional: 0, independent unconditional: 2253, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 116, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 668, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 573, dependent conditional: 0, dependent unconditional: 573, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4379, independent: 1891, independent conditional: 0, independent unconditional: 1891, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 2369, unknown conditional: 0, unknown unconditional: 2369] , Statistics on independence cache: Total cache size (in pairs): 317, Positive cache size: 287, Positive conditional cache size: 0, Positive unconditional cache size: 287, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1517; [L835] FCALL, FORK 0 pthread_create(&t1517, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1517, ((void *)0), P0, ((void *)0))=-3, t1517={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1518; [L837] FCALL, FORK 0 pthread_create(&t1518, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1518, ((void *)0), P1, ((void *)0))=-2, t1517={5:0}, t1518={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1519; [L839] FCALL, FORK 0 pthread_create(&t1519, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1519, ((void *)0), P2, ((void *)0))=-1, t1517={5:0}, t1518={6:0}, t1519={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1520; [L841] FCALL, FORK 0 pthread_create(&t1520, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1520, ((void *)0), P3, ((void *)0))=0, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L800] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L800] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, 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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, 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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, 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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, 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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, 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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, 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, t1517={5:0}, t1518={6:0}, t1519={7:0}, t1520={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L869] 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 832]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 839]: 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: 835]: 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: 841]: 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: 837]: 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, 178 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 30.6s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 948 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 948 mSDsluCounter, 459 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 298 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2252 IncrementalHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 161 mSDtfsCounter, 2252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3444occurred in iteration=0, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 6218 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 358 NumberOfCodeBlocks, 358 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 311 ConstructedInterpolants, 0 QuantifiedInterpolants, 3845 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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-20 10:57:55,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN --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 a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 --- 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-6b4ec56 [2022-11-20 10:57:58,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:57:58,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:57:58,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:57:58,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:57:58,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:57:58,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:57:58,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:57:58,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:57:58,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:57:58,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:57:58,439 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:57:58,440 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:57:58,441 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:57:58,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:57:58,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:57:58,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:57:58,445 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:57:58,447 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:57:58,449 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:57:58,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:57:58,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:57:58,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:57:58,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:57:58,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:57:58,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:57:58,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:57:58,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:57:58,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:57:58,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:57:58,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:57:58,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:57:58,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:57:58,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:57:58,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:57:58,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:57:58,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:57:58,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:57:58,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:57:58,472 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:57:58,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:57:58,474 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-20 10:57:58,499 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:57:58,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:57:58,505 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:57:58,505 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:57:58,506 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:57:58,507 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:57:58,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:57:58,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:57:58,508 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:57:58,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:57:58,510 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:57:58,510 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:57:58,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:57:58,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:57:58,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:57:58,511 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 10:57:58,511 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 10:57:58,511 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 10:57:58,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:57:58,511 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:57:58,512 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 10:57:58,512 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 10:57:58,512 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:57:58,512 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:57:58,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:57:58,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:57:58,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:57:58,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:57:58,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:57:58,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:57:58,514 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 10:57:58,514 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 10:57:58,515 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 10:57:58,515 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_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN 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 -> a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 [2022-11-20 10:57:58,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:57:58,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:57:58,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:57:58,967 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:57:58,968 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:57:58,969 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-20 10:58:02,230 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:58:02,555 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:58:02,556 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-20 10:58:02,576 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/data/5cb8e3520/b53cb027a44b4de789aac82b8d0dd22d/FLAG52ce76ea2 [2022-11-20 10:58:02,594 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/data/5cb8e3520/b53cb027a44b4de789aac82b8d0dd22d [2022-11-20 10:58:02,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:58:02,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:58:02,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:58:02,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:58:02,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:58:02,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:58:02" (1/1) ... [2022-11-20 10:58:02,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e1644ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:02, skipping insertion in model container [2022-11-20 10:58:02,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:58:02" (1/1) ... [2022-11-20 10:58:02,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:58:02,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:58:02,938 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-20 10:58:03,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:58:03,254 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:58:03,274 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-20 10:58:03,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:58:03,407 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:58:03,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:03 WrapperNode [2022-11-20 10:58:03,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:58:03,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:58:03,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:58:03,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:58:03,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:03" (1/1) ... [2022-11-20 10:58:03,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:03" (1/1) ... [2022-11-20 10:58:03,499 INFO L138 Inliner]: procedures = 180, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 158 [2022-11-20 10:58:03,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:58:03,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:58:03,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:58:03,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:58:03,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:03" (1/1) ... [2022-11-20 10:58:03,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:03" (1/1) ... [2022-11-20 10:58:03,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:03" (1/1) ... [2022-11-20 10:58:03,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:03" (1/1) ... [2022-11-20 10:58:03,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:03" (1/1) ... [2022-11-20 10:58:03,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:03" (1/1) ... [2022-11-20 10:58:03,573 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:03" (1/1) ... [2022-11-20 10:58:03,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:03" (1/1) ... [2022-11-20 10:58:03,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:58:03,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:58:03,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:58:03,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:58:03,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:03" (1/1) ... [2022-11-20 10:58:03,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:58:03,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:58:03,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:58:03,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:58:03,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 10:58:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:58:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:58:03,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:58:03,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 10:58:03,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 10:58:03,713 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 10:58:03,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 10:58:03,715 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 10:58:03,715 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 10:58:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 10:58:03,720 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 10:58:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-20 10:58:03,721 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-20 10:58:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 10:58:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:58:03,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:58:03,724 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 10:58:03,918 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:58:03,920 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:58:04,498 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:58:04,731 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:58:04,734 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:58:04,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:58:04 BoogieIcfgContainer [2022-11-20 10:58:04,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:58:04,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:58:04,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:58:04,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:58:04,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:58:02" (1/3) ... [2022-11-20 10:58:04,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b218e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:58:04, skipping insertion in model container [2022-11-20 10:58:04,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:03" (2/3) ... [2022-11-20 10:58:04,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b218e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:58:04, skipping insertion in model container [2022-11-20 10:58:04,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:58:04" (3/3) ... [2022-11-20 10:58:04,755 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-20 10:58:04,780 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:58:04,780 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-20 10:58:04,781 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:58:04,897 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 10:58:04,952 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 10:58:04,981 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 145 transitions, 310 flow [2022-11-20 10:58:04,988 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 145 transitions, 310 flow [2022-11-20 10:58:04,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 310 flow [2022-11-20 10:58:05,128 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2022-11-20 10:58:05,129 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:58:05,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2022-11-20 10:58:05,142 INFO L119 LiptonReduction]: Number of co-enabled transitions 3262 [2022-11-20 10:58:17,910 INFO L134 LiptonReduction]: Checked pairs total: 8212 [2022-11-20 10:58:17,910 INFO L136 LiptonReduction]: Total number of compositions: 133 [2022-11-20 10:58:17,920 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 54 places, 42 transitions, 104 flow [2022-11-20 10:58:18,225 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3444 states, 3431 states have (on average 4.0104925677645005) internal successors, (13760), 3443 states have internal predecessors, (13760), 0 states have call successors, (0), 0 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-20 10:58:18,254 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:58:18,264 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;@2aad74dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:58:18,264 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-20 10:58:18,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 3444 states, 3431 states have (on average 4.0104925677645005) internal successors, (13760), 3443 states have internal predecessors, (13760), 0 states have call successors, (0), 0 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-20 10:58:18,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 10:58:18,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:18,292 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 10:58:18,294 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:58:18,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:18,304 INFO L85 PathProgramCache]: Analyzing trace with hash 587, now seen corresponding path program 1 times [2022-11-20 10:58:18,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:58:18,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729619237] [2022-11-20 10:58:18,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:18,328 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-20 10:58:18,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:58:18,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:18,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:18,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 10:58:18,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:58:18,507 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-20 10:58:18,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:58:18,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:58:18,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729619237] [2022-11-20 10:58:18,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729619237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:18,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:18,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 10:58:18,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370549047] [2022-11-20 10:58:18,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:18,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:58:18,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:58:18,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:58:18,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:58:18,578 INFO L87 Difference]: Start difference. First operand has 3444 states, 3431 states have (on average 4.0104925677645005) internal successors, (13760), 3443 states have internal predecessors, (13760), 0 states have call successors, (0), 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-20 10:58:19,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:19,001 INFO L93 Difference]: Finished difference Result 3242 states and 12656 transitions. [2022-11-20 10:58:19,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:58:19,004 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-20 10:58:19,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:19,073 INFO L225 Difference]: With dead ends: 3242 [2022-11-20 10:58:19,073 INFO L226 Difference]: Without dead ends: 3242 [2022-11-20 10:58:19,074 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-20 10:58:19,080 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:19,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:58:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2022-11-20 10:58:19,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 3242. [2022-11-20 10:58:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3242 states, 3237 states have (on average 3.909793018226753) internal successors, (12656), 3241 states have internal predecessors, (12656), 0 states have call successors, (0), 0 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-20 10:58:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3242 states to 3242 states and 12656 transitions. [2022-11-20 10:58:19,431 INFO L78 Accepts]: Start accepts. Automaton has 3242 states and 12656 transitions. Word has length 1 [2022-11-20 10:58:19,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:19,432 INFO L495 AbstractCegarLoop]: Abstraction has 3242 states and 12656 transitions. [2022-11-20 10:58:19,432 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-20 10:58:19,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3242 states and 12656 transitions. [2022-11-20 10:58:19,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 10:58:19,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:19,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:19,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:58:19,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:19,650 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:58:19,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:19,650 INFO L85 PathProgramCache]: Analyzing trace with hash 26063220, now seen corresponding path program 1 times [2022-11-20 10:58:19,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:58:19,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255092465] [2022-11-20 10:58:19,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:19,652 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-20 10:58:19,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:58:19,654 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:19,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:19,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:58:19,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:58:19,840 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-20 10:58:19,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:58:19,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:58:19,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255092465] [2022-11-20 10:58:19,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255092465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:19,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:19,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 10:58:19,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541475137] [2022-11-20 10:58:19,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:19,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:58:19,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:58:19,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:58:19,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:58:19,845 INFO L87 Difference]: Start difference. First operand 3242 states and 12656 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:20,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:20,122 INFO L93 Difference]: Finished difference Result 2682 states and 10328 transitions. [2022-11-20 10:58:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:58:20,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 10:58:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:20,145 INFO L225 Difference]: With dead ends: 2682 [2022-11-20 10:58:20,146 INFO L226 Difference]: Without dead ends: 2602 [2022-11-20 10:58:20,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-20 10:58:20,147 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:20,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:58:20,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2022-11-20 10:58:20,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2022-11-20 10:58:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2602 states, 2600 states have (on average 3.870769230769231) internal successors, (10064), 2601 states have internal predecessors, (10064), 0 states have call successors, (0), 0 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-20 10:58:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2022-11-20 10:58:20,306 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2022-11-20 10:58:20,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:20,308 INFO L495 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2022-11-20 10:58:20,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:20,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2022-11-20 10:58:20,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 10:58:20,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:20,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:20,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:58:20,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:20,524 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:58:20,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:20,525 INFO L85 PathProgramCache]: Analyzing trace with hash -722959295, now seen corresponding path program 1 times [2022-11-20 10:58:20,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:58:20,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765836984] [2022-11-20 10:58:20,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:20,526 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-20 10:58:20,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:58:20,528 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:20,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:20,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:58:20,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:58:20,807 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-20 10:58:20,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:58:20,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:58:20,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765836984] [2022-11-20 10:58:20,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765836984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:20,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:20,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:58:20,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587926052] [2022-11-20 10:58:20,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:20,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:58:20,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:58:20,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:58:20,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:58:20,815 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:21,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:21,195 INFO L93 Difference]: Finished difference Result 2282 states and 7848 transitions. [2022-11-20 10:58:21,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:58:21,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 10:58:21,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:21,221 INFO L225 Difference]: With dead ends: 2282 [2022-11-20 10:58:21,221 INFO L226 Difference]: Without dead ends: 1882 [2022-11-20 10:58:21,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:58:21,227 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 39 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:21,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 20 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:58:21,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-11-20 10:58:21,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1882. [2022-11-20 10:58:21,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1880 states have (on average 3.4382978723404256) internal successors, (6464), 1881 states have internal predecessors, (6464), 0 states have call successors, (0), 0 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-20 10:58:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 6464 transitions. [2022-11-20 10:58:21,385 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 6464 transitions. Word has length 11 [2022-11-20 10:58:21,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:21,385 INFO L495 AbstractCegarLoop]: Abstraction has 1882 states and 6464 transitions. [2022-11-20 10:58:21,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:21,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 6464 transitions. [2022-11-20 10:58:21,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 10:58:21,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:21,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:21,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:21,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:21,613 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:58:21,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:21,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1765708322, now seen corresponding path program 1 times [2022-11-20 10:58:21,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:58:21,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138239589] [2022-11-20 10:58:21,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:21,615 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-20 10:58:21,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:58:21,619 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:21,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:21,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:58:21,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:58:21,841 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-20 10:58:21,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:58:21,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:58:21,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138239589] [2022-11-20 10:58:21,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138239589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:21,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:21,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:58:21,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474494118] [2022-11-20 10:58:21,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:21,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:58:21,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:58:21,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:58:21,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:58:21,849 INFO L87 Difference]: Start difference. First operand 1882 states and 6464 transitions. Second operand has 5 states, 5 states have (on average 2.8) 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-20 10:58:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:22,201 INFO L93 Difference]: Finished difference Result 1298 states and 3936 transitions. [2022-11-20 10:58:22,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:58:22,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) 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-20 10:58:22,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:22,211 INFO L225 Difference]: With dead ends: 1298 [2022-11-20 10:58:22,212 INFO L226 Difference]: Without dead ends: 1042 [2022-11-20 10:58:22,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:58:22,222 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 53 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:22,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 36 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:58:22,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2022-11-20 10:58:22,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2022-11-20 10:58:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1040 states have (on average 2.9846153846153847) internal successors, (3104), 1041 states have internal predecessors, (3104), 0 states have call successors, (0), 0 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-20 10:58:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 3104 transitions. [2022-11-20 10:58:22,270 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 3104 transitions. Word has length 14 [2022-11-20 10:58:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:22,277 INFO L495 AbstractCegarLoop]: Abstraction has 1042 states and 3104 transitions. [2022-11-20 10:58:22,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) 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-20 10:58:22,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 3104 transitions. [2022-11-20 10:58:22,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 10:58:22,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:22,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:22,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:22,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:22,500 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:58:22,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:22,500 INFO L85 PathProgramCache]: Analyzing trace with hash 454921255, now seen corresponding path program 1 times [2022-11-20 10:58:22,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:58:22,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727173211] [2022-11-20 10:58:22,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:22,501 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-20 10:58:22,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:58:22,502 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:22,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:22,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 10:58:22,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:58:22,750 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-20 10:58:22,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:58:22,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:58:22,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727173211] [2022-11-20 10:58:22,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727173211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:22,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:22,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:58:22,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156446517] [2022-11-20 10:58:22,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:22,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:58:22,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:58:22,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:58:22,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:58:22,754 INFO L87 Difference]: Start difference. First operand 1042 states and 3104 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:23,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:23,193 INFO L93 Difference]: Finished difference Result 765 states and 2242 transitions. [2022-11-20 10:58:23,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:58:23,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 10:58:23,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:23,199 INFO L225 Difference]: With dead ends: 765 [2022-11-20 10:58:23,199 INFO L226 Difference]: Without dead ends: 677 [2022-11-20 10:58:23,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:58:23,200 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 65 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:23,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 64 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:58:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-11-20 10:58:23,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2022-11-20 10:58:23,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 675 states have (on average 2.9762962962962964) internal successors, (2009), 676 states have internal predecessors, (2009), 0 states have call successors, (0), 0 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-20 10:58:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 2009 transitions. [2022-11-20 10:58:23,227 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 2009 transitions. Word has length 17 [2022-11-20 10:58:23,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:23,228 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 2009 transitions. [2022-11-20 10:58:23,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:23,228 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 2009 transitions. [2022-11-20 10:58:23,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 10:58:23,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:23,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:23,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:23,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:23,454 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:58:23,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:23,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1908656589, now seen corresponding path program 1 times [2022-11-20 10:58:23,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:58:23,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551269038] [2022-11-20 10:58:23,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:23,455 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-20 10:58:23,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:58:23,457 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:23,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:23,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 10:58:23,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:58:23,765 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-20 10:58:23,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:58:23,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:58:23,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551269038] [2022-11-20 10:58:23,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551269038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:23,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:23,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:58:23,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924667075] [2022-11-20 10:58:23,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:23,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:58:23,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:58:23,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:58:23,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:58:23,768 INFO L87 Difference]: Start difference. First operand 677 states and 2009 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:24,340 INFO L93 Difference]: Finished difference Result 622 states and 1897 transitions. [2022-11-20 10:58:24,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:58:24,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-20 10:58:24,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:24,347 INFO L225 Difference]: With dead ends: 622 [2022-11-20 10:58:24,347 INFO L226 Difference]: Without dead ends: 607 [2022-11-20 10:58:24,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:58:24,349 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 60 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:24,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 96 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:58:24,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2022-11-20 10:58:24,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2022-11-20 10:58:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 605 states have (on average 3.0892561983471074) internal successors, (1869), 606 states have internal predecessors, (1869), 0 states have call successors, (0), 0 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-20 10:58:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1869 transitions. [2022-11-20 10:58:24,383 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1869 transitions. Word has length 21 [2022-11-20 10:58:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:24,383 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 1869 transitions. [2022-11-20 10:58:24,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:58:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1869 transitions. [2022-11-20 10:58:24,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 10:58:24,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:24,388 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-20 10:58:24,409 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:24,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:24,603 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:58:24,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:24,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1516423915, now seen corresponding path program 1 times [2022-11-20 10:58:24,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:58:24,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122301493] [2022-11-20 10:58:24,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:58:24,605 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-20 10:58:24,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:58:24,613 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:24,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:58:24,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:58:24,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:58:24,872 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-20 10:58:24,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:58:24,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:58:24,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122301493] [2022-11-20 10:58:24,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122301493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:24,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:24,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:58:24,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369471245] [2022-11-20 10:58:24,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:24,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:58:24,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:58:24,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:58:24,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:58:24,875 INFO L87 Difference]: Start difference. First operand 607 states and 1869 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-20 10:58:25,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:25,065 INFO L93 Difference]: Finished difference Result 791 states and 2392 transitions. [2022-11-20 10:58:25,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:58:25,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-20 10:58:25,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:25,071 INFO L225 Difference]: With dead ends: 791 [2022-11-20 10:58:25,071 INFO L226 Difference]: Without dead ends: 791 [2022-11-20 10:58:25,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-20 10:58:25,072 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:25,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 16 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:58:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-11-20 10:58:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 789. [2022-11-20 10:58:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 787 states have (on average 3.0381194409148664) internal successors, (2391), 788 states have internal predecessors, (2391), 0 states have call successors, (0), 0 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-20 10:58:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2391 transitions. [2022-11-20 10:58:25,113 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2391 transitions. Word has length 25 [2022-11-20 10:58:25,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:25,113 INFO L495 AbstractCegarLoop]: Abstraction has 789 states and 2391 transitions. [2022-11-20 10:58:25,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-20 10:58:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2391 transitions. [2022-11-20 10:58:25,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 10:58:25,117 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:25,117 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-20 10:58:25,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:25,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:25,330 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:58:25,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:25,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1309160311, now seen corresponding path program 2 times [2022-11-20 10:58:25,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:58:25,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284257570] [2022-11-20 10:58:25,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:58:25,332 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-20 10:58:25,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:58:25,333 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:25,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:25,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 10:58:25,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:58:25,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:58:25,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:58:25,519 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-20 10:58:25,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:58:25,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:58:25,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284257570] [2022-11-20 10:58:25,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284257570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:25,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:25,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:58:25,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333493825] [2022-11-20 10:58:25,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:25,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:58:25,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:58:25,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:58:25,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:58:25,521 INFO L87 Difference]: Start difference. First operand 789 states and 2391 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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-20 10:58:25,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:25,668 INFO L93 Difference]: Finished difference Result 1107 states and 3254 transitions. [2022-11-20 10:58:25,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:58:25,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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-20 10:58:25,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:25,676 INFO L225 Difference]: With dead ends: 1107 [2022-11-20 10:58:25,676 INFO L226 Difference]: Without dead ends: 1107 [2022-11-20 10:58:25,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-20 10:58:25,678 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:25,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 10 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:58:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2022-11-20 10:58:25,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 744. [2022-11-20 10:58:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 742 states have (on average 3.032345013477089) internal successors, (2250), 743 states have internal predecessors, (2250), 0 states have call successors, (0), 0 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-20 10:58:25,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 2250 transitions. [2022-11-20 10:58:25,714 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 2250 transitions. Word has length 25 [2022-11-20 10:58:25,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:25,714 INFO L495 AbstractCegarLoop]: Abstraction has 744 states and 2250 transitions. [2022-11-20 10:58:25,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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-20 10:58:25,715 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 2250 transitions. [2022-11-20 10:58:25,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 10:58:25,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:25,717 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-20 10:58:25,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:25,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:25,938 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:58:25,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:25,938 INFO L85 PathProgramCache]: Analyzing trace with hash -430765459, now seen corresponding path program 3 times [2022-11-20 10:58:25,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:58:25,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206752862] [2022-11-20 10:58:25,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:58:25,939 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-20 10:58:25,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:58:25,940 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:25,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:26,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 10:58:26,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:58:26,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:58:26,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:58:26,127 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-20 10:58:26,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:58:26,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:58:26,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206752862] [2022-11-20 10:58:26,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206752862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:58:26,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:58:26,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:58:26,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864265098] [2022-11-20 10:58:26,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:58:26,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:58:26,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:58:26,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:58:26,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:58:26,130 INFO L87 Difference]: Start difference. First operand 744 states and 2250 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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-20 10:58:26,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:58:26,261 INFO L93 Difference]: Finished difference Result 1022 states and 3013 transitions. [2022-11-20 10:58:26,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:58:26,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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-20 10:58:26,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:58:26,268 INFO L225 Difference]: With dead ends: 1022 [2022-11-20 10:58:26,268 INFO L226 Difference]: Without dead ends: 1022 [2022-11-20 10:58:26,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-20 10:58:26,269 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:58:26,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 10 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:58:26,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2022-11-20 10:58:26,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 684. [2022-11-20 10:58:26,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 682 states have (on average 3.033724340175953) internal successors, (2069), 683 states have internal predecessors, (2069), 0 states have call successors, (0), 0 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-20 10:58:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 2069 transitions. [2022-11-20 10:58:26,298 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 2069 transitions. Word has length 25 [2022-11-20 10:58:26,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:58:26,299 INFO L495 AbstractCegarLoop]: Abstraction has 684 states and 2069 transitions. [2022-11-20 10:58:26,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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-20 10:58:26,299 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 2069 transitions. [2022-11-20 10:58:26,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 10:58:26,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:58:26,302 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-20 10:58:26,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:26,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:26,515 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-20 10:58:26,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:58:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash 545871365, now seen corresponding path program 4 times [2022-11-20 10:58:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:58:26,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112068757] [2022-11-20 10:58:26,516 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 10:58:26,517 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-20 10:58:26,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:58:26,518 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:26,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:26,743 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 10:58:26,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 10:58:26,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:58:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:58:26,971 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-20 10:58:26,971 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:58:26,973 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-20 10:58:26,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-20 10:58:26,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-20 10:58:26,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-20 10:58:26,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-20 10:58:26,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-20 10:58:26,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-20 10:58:26,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-20 10:58:26,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-20 10:58:26,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-20 10:58:26,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-20 10:58:26,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-20 10:58:26,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-20 10:58:26,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-20 10:58:26,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-20 10:58:26,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-20 10:58:27,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:27,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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-20 10:58:27,203 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:27,209 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 10:58:27,209 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:58:27,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:58:27 BasicIcfg [2022-11-20 10:58:27,355 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:58:27,356 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:58:27,356 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:58:27,357 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:58:27,357 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:58:04" (3/4) ... [2022-11-20 10:58:27,361 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 10:58:27,361 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:58:27,362 INFO L158 Benchmark]: Toolchain (without parser) took 24763.02ms. Allocated memory was 62.9MB in the beginning and 226.5MB in the end (delta: 163.6MB). Free memory was 29.7MB in the beginning and 140.3MB in the end (delta: -110.6MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2022-11-20 10:58:27,363 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 62.9MB. Free memory is still 40.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:58:27,363 INFO L158 Benchmark]: CACSL2BoogieTranslator took 808.00ms. Allocated memory was 62.9MB in the beginning and 88.1MB in the end (delta: 25.2MB). Free memory was 29.5MB in the beginning and 62.4MB in the end (delta: -32.9MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2022-11-20 10:58:27,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.58ms. Allocated memory is still 88.1MB. Free memory was 62.4MB in the beginning and 59.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 10:58:27,364 INFO L158 Benchmark]: Boogie Preprocessor took 95.87ms. Allocated memory is still 88.1MB. Free memory was 59.6MB in the beginning and 57.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:58:27,365 INFO L158 Benchmark]: RCFGBuilder took 1140.64ms. Allocated memory is still 88.1MB. Free memory was 57.5MB in the beginning and 38.6MB in the end (delta: 18.9MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-11-20 10:58:27,366 INFO L158 Benchmark]: TraceAbstraction took 22611.80ms. Allocated memory was 88.1MB in the beginning and 226.5MB in the end (delta: 138.4MB). Free memory was 37.9MB in the beginning and 141.4MB in the end (delta: -103.4MB). Peak memory consumption was 112.6MB. Max. memory is 16.1GB. [2022-11-20 10:58:27,367 INFO L158 Benchmark]: Witness Printer took 4.96ms. Allocated memory is still 226.5MB. Free memory was 141.4MB in the beginning and 140.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:58:27,368 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.33ms. Allocated memory is still 62.9MB. Free memory is still 40.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 808.00ms. Allocated memory was 62.9MB in the beginning and 88.1MB in the end (delta: 25.2MB). Free memory was 29.5MB in the beginning and 62.4MB in the end (delta: -32.9MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.58ms. Allocated memory is still 88.1MB. Free memory was 62.4MB in the beginning and 59.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.87ms. Allocated memory is still 88.1MB. Free memory was 59.6MB in the beginning and 57.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1140.64ms. Allocated memory is still 88.1MB. Free memory was 57.5MB in the beginning and 38.6MB in the end (delta: 18.9MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22611.80ms. Allocated memory was 88.1MB in the beginning and 226.5MB in the end (delta: 138.4MB). Free memory was 37.9MB in the beginning and 141.4MB in the end (delta: -103.4MB). Peak memory consumption was 112.6MB. Max. memory is 16.1GB. * Witness Printer took 4.96ms. Allocated memory is still 226.5MB. Free memory was 141.4MB in the beginning and 140.3MB 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: 12.9s, 156 PlacesBefore, 54 PlacesAfterwards, 145 TransitionsBefore, 42 TransitionsAfterwards, 3262 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 133 TotalNumberOfCompositions, 8212 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4310, independent: 4114, independent conditional: 0, independent unconditional: 4114, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2364, independent: 2289, independent conditional: 0, independent unconditional: 2289, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2364, independent: 2253, independent conditional: 0, independent unconditional: 2253, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 111, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 747, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 647, dependent conditional: 0, dependent unconditional: 647, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4310, independent: 1825, independent conditional: 0, independent unconditional: 1825, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 2364, unknown conditional: 0, unknown unconditional: 2364] , Statistics on independence cache: Total cache size (in pairs): 312, Positive cache size: 282, Positive conditional cache size: 0, Positive unconditional cache size: 282, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1517; [L835] FCALL, FORK 0 pthread_create(&t1517, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1517, ((void *)0), P0, ((void *)0))=0, t1517={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1518; [L837] FCALL, FORK 0 pthread_create(&t1518, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1518, ((void *)0), P1, ((void *)0))=1, t1517={11:0}, t1518={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1519; [L839] FCALL, FORK 0 pthread_create(&t1519, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1519, ((void *)0), P2, ((void *)0))=2, t1517={11:0}, t1518={15:0}, t1519={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1520; [L841] FCALL, FORK 0 pthread_create(&t1520, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1520, ((void *)0), P3, ((void *)0))=3, t1517={11:0}, t1518={15:0}, t1519={7:0}, t1520={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L800] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L800] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L779] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, 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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, 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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, 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, t1517={11:0}, t1518={15:0}, t1519={7:0}, t1520={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L869] 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 832]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 837]: 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: 839]: 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: 835]: 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: 841]: 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, 179 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 22.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 283 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 283 mSDsluCounter, 264 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 177 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1173 IncrementalHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 87 mSDtfsCounter, 1173 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3444occurred in iteration=0, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 703 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 335 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1281 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-20 10:58:27,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9d344a3-fd80-409f-b1d3-dea20597179a/bin/uautomizer-ug76WZFUDN/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