./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 18:48:45,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 18:48:45,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 18:48:45,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 18:48:45,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 18:48:45,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 18:48:45,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 18:48:45,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 18:48:45,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 18:48:45,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 18:48:45,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 18:48:45,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 18:48:45,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 18:48:45,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 18:48:45,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 18:48:45,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 18:48:45,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 18:48:45,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 18:48:45,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 18:48:45,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 18:48:45,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 18:48:45,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 18:48:45,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 18:48:45,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 18:48:45,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 18:48:45,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 18:48:45,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 18:48:45,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 18:48:45,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 18:48:45,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 18:48:45,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 18:48:45,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 18:48:45,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 18:48:45,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 18:48:45,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 18:48:45,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 18:48:45,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 18:48:45,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 18:48:45,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 18:48:45,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 18:48:45,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 18:48:45,728 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 18:48:45,754 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 18:48:45,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 18:48:45,754 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 18:48:45,755 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 18:48:45,756 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 18:48:45,756 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 18:48:45,757 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 18:48:45,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 18:48:45,757 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 18:48:45,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 18:48:45,758 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 18:48:45,758 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 18:48:45,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 18:48:45,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 18:48:45,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 18:48:45,759 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 18:48:45,759 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 18:48:45,759 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 18:48:45,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 18:48:45,760 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 18:48:45,760 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 18:48:45,760 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 18:48:45,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 18:48:45,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 18:48:45,761 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 18:48:45,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:48:45,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 18:48:45,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 18:48:45,762 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 18:48:45,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 18:48:45,762 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_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 [2022-11-18 18:48:46,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 18:48:46,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 18:48:46,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 18:48:46,077 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 18:48:46,078 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 18:48:46,079 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-18 18:48:46,162 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/data/52d19cf32/980f6091bda6453db0b51c5a7e797984/FLAG0cc7e8feb [2022-11-18 18:48:46,817 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 18:48:46,817 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-18 18:48:46,833 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/data/52d19cf32/980f6091bda6453db0b51c5a7e797984/FLAG0cc7e8feb [2022-11-18 18:48:47,108 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/data/52d19cf32/980f6091bda6453db0b51c5a7e797984 [2022-11-18 18:48:47,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 18:48:47,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 18:48:47,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 18:48:47,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 18:48:47,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 18:48:47,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:48:47" (1/1) ... [2022-11-18 18:48:47,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@325d34c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:48:47, skipping insertion in model container [2022-11-18 18:48:47,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:48:47" (1/1) ... [2022-11-18 18:48:47,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 18:48:47,178 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 18:48:47,383 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2022-11-18 18:48:47,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:48:47,654 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 18:48:47,678 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2022-11-18 18:48:47,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:48:47,813 INFO L208 MainTranslator]: Completed translation [2022-11-18 18:48:47,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:48:47 WrapperNode [2022-11-18 18:48:47,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 18:48:47,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 18:48:47,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 18:48:47,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 18:48:47,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:48:47" (1/1) ... [2022-11-18 18:48:47,859 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:48:47" (1/1) ... [2022-11-18 18:48:47,884 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2022-11-18 18:48:47,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 18:48:47,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 18:48:47,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 18:48:47,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 18:48:47,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:48:47" (1/1) ... [2022-11-18 18:48:47,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:48:47" (1/1) ... [2022-11-18 18:48:47,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:48:47" (1/1) ... [2022-11-18 18:48:47,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:48:47" (1/1) ... [2022-11-18 18:48:47,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:48:47" (1/1) ... [2022-11-18 18:48:47,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:48:47" (1/1) ... [2022-11-18 18:48:47,946 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:48:47" (1/1) ... [2022-11-18 18:48:47,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:48:47" (1/1) ... [2022-11-18 18:48:47,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 18:48:47,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 18:48:47,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 18:48:47,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 18:48:47,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:48:47" (1/1) ... [2022-11-18 18:48:47,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:48:47,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:48:48,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 18:48:48,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 18:48:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 18:48:48,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 18:48:48,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 18:48:48,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 18:48:48,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 18:48:48,058 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 18:48:48,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 18:48:48,059 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 18:48:48,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 18:48:48,059 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 18:48:48,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 18:48:48,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 18:48:48,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 18:48:48,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 18:48:48,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 18:48:48,062 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 18:48:48,325 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 18:48:48,327 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 18:48:48,871 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 18:48:49,041 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 18:48:49,045 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 18:48:49,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:48:49 BoogieIcfgContainer [2022-11-18 18:48:49,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 18:48:49,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 18:48:49,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 18:48:49,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 18:48:49,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:48:47" (1/3) ... [2022-11-18 18:48:49,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144ba1b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:48:49, skipping insertion in model container [2022-11-18 18:48:49,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:48:47" (2/3) ... [2022-11-18 18:48:49,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144ba1b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:48:49, skipping insertion in model container [2022-11-18 18:48:49,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:48:49" (3/3) ... [2022-11-18 18:48:49,059 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-18 18:48:49,080 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 18:48:49,080 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-18 18:48:49,080 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 18:48:49,178 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 18:48:49,223 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 18:48:49,239 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 131 transitions, 277 flow [2022-11-18 18:48:49,242 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 131 transitions, 277 flow [2022-11-18 18:48:49,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 131 transitions, 277 flow [2022-11-18 18:48:49,325 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-11-18 18:48:49,325 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 18:48:49,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2022-11-18 18:48:49,334 INFO L119 LiptonReduction]: Number of co-enabled transitions 2698 [2022-11-18 18:48:54,902 INFO L134 LiptonReduction]: Checked pairs total: 7665 [2022-11-18 18:48:54,902 INFO L136 LiptonReduction]: Total number of compositions: 126 [2022-11-18 18:48:54,915 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 37 transitions, 89 flow [2022-11-18 18:48:55,073 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1492 states, 1477 states have (on average 3.3947190250507786) internal successors, (5014), 1491 states have internal predecessors, (5014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:55,100 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:48:55,108 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;@7cab21a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:48:55,108 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-18 18:48:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 1492 states, 1477 states have (on average 3.3947190250507786) internal successors, (5014), 1491 states have internal predecessors, (5014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:55,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 18:48:55,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:48:55,121 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 18:48:55,122 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:48:55,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:48:55,128 INFO L85 PathProgramCache]: Analyzing trace with hash 559, now seen corresponding path program 1 times [2022-11-18 18:48:55,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:48:55,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915320969] [2022-11-18 18:48:55,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:48:55,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:48:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:48:55,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-18 18:48:55,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:48:55,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915320969] [2022-11-18 18:48:55,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915320969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:48:55,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:48:55,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 18:48:55,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928157036] [2022-11-18 18:48:55,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:48:55,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 18:48:55,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:48:55,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 18:48:55,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 18:48:55,323 INFO L87 Difference]: Start difference. First operand has 1492 states, 1477 states have (on average 3.3947190250507786) internal successors, (5014), 1491 states have internal predecessors, (5014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:55,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:48:55,468 INFO L93 Difference]: Finished difference Result 1406 states and 4590 transitions. [2022-11-18 18:48:55,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 18:48:55,471 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-18 18:48:55,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:48:55,511 INFO L225 Difference]: With dead ends: 1406 [2022-11-18 18:48:55,512 INFO L226 Difference]: Without dead ends: 1406 [2022-11-18 18:48:55,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 18:48:55,517 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:48:55,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:48:55,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2022-11-18 18:48:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1406. [2022-11-18 18:48:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1401 states have (on average 3.2762312633832975) internal successors, (4590), 1405 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 4590 transitions. [2022-11-18 18:48:55,665 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 4590 transitions. Word has length 1 [2022-11-18 18:48:55,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:48:55,666 INFO L495 AbstractCegarLoop]: Abstraction has 1406 states and 4590 transitions. [2022-11-18 18:48:55,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:55,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 4590 transitions. [2022-11-18 18:48:55,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 18:48:55,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:48:55,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 18:48:55,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 18:48:55,674 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:48:55,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:48:55,676 INFO L85 PathProgramCache]: Analyzing trace with hash 548154, now seen corresponding path program 1 times [2022-11-18 18:48:55,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:48:55,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518882594] [2022-11-18 18:48:55,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:48:55,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:48:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:48:55,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:48:55,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:48:55,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518882594] [2022-11-18 18:48:55,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518882594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:48:55,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:48:55,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 18:48:55,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210734570] [2022-11-18 18:48:55,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:48:55,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:48:55,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:48:55,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:48:55,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:48:55,956 INFO L87 Difference]: Start difference. First operand 1406 states and 4590 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:56,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:48:56,066 INFO L93 Difference]: Finished difference Result 1184 states and 3825 transitions. [2022-11-18 18:48:56,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:48:56,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-18 18:48:56,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:48:56,076 INFO L225 Difference]: With dead ends: 1184 [2022-11-18 18:48:56,076 INFO L226 Difference]: Without dead ends: 1154 [2022-11-18 18:48:56,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:48:56,086 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:48:56,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 6 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:48:56,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2022-11-18 18:48:56,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1154. [2022-11-18 18:48:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1152 states have (on average 3.251736111111111) internal successors, (3746), 1153 states have internal predecessors, (3746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 3746 transitions. [2022-11-18 18:48:56,154 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 3746 transitions. Word has length 3 [2022-11-18 18:48:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:48:56,154 INFO L495 AbstractCegarLoop]: Abstraction has 1154 states and 3746 transitions. [2022-11-18 18:48:56,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:56,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 3746 transitions. [2022-11-18 18:48:56,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 18:48:56,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:48:56,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:48:56,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 18:48:56,157 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:48:56,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:48:56,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1809420359, now seen corresponding path program 1 times [2022-11-18 18:48:56,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:48:56,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576120209] [2022-11-18 18:48:56,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:48:56,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:48:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:48:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:48:56,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:48:56,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576120209] [2022-11-18 18:48:56,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576120209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:48:56,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:48:56,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 18:48:56,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007214246] [2022-11-18 18:48:56,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:48:56,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:48:56,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:48:56,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:48:56,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:48:56,553 INFO L87 Difference]: Start difference. First operand 1154 states and 3746 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-18 18:48:56,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:48:56,678 INFO L93 Difference]: Finished difference Result 1916 states and 6018 transitions. [2022-11-18 18:48:56,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:48:56,678 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-18 18:48:56,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:48:56,692 INFO L225 Difference]: With dead ends: 1916 [2022-11-18 18:48:56,692 INFO L226 Difference]: Without dead ends: 1916 [2022-11-18 18:48:56,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:48:56,697 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:48:56,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:48:56,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2022-11-18 18:48:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1474. [2022-11-18 18:48:56,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1472 states have (on average 3.2472826086956523) internal successors, (4780), 1473 states have internal predecessors, (4780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:56,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 4780 transitions. [2022-11-18 18:48:56,764 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 4780 transitions. Word has length 9 [2022-11-18 18:48:56,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:48:56,765 INFO L495 AbstractCegarLoop]: Abstraction has 1474 states and 4780 transitions. [2022-11-18 18:48:56,765 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-18 18:48:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 4780 transitions. [2022-11-18 18:48:56,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 18:48:56,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:48:56,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:48:56,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 18:48:56,769 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:48:56,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:48:56,771 INFO L85 PathProgramCache]: Analyzing trace with hash -257509679, now seen corresponding path program 1 times [2022-11-18 18:48:56,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:48:56,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24806193] [2022-11-18 18:48:56,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:48:56,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:48:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:48:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:48:57,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:48:57,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24806193] [2022-11-18 18:48:57,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24806193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:48:57,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:48:57,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:48:57,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018006447] [2022-11-18 18:48:57,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:48:57,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:48:57,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:48:57,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:48:57,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:48:57,053 INFO L87 Difference]: Start difference. First operand 1474 states and 4780 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:57,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:48:57,179 INFO L93 Difference]: Finished difference Result 1736 states and 5454 transitions. [2022-11-18 18:48:57,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 18:48:57,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-18 18:48:57,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:48:57,190 INFO L225 Difference]: With dead ends: 1736 [2022-11-18 18:48:57,190 INFO L226 Difference]: Without dead ends: 1736 [2022-11-18 18:48:57,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:48:57,191 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 40 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 5 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-18 18:48:57,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 5 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:48:57,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2022-11-18 18:48:57,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1310. [2022-11-18 18:48:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1308 states have (on average 3.2339449541284404) internal successors, (4230), 1309 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:57,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 4230 transitions. [2022-11-18 18:48:57,242 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 4230 transitions. Word has length 10 [2022-11-18 18:48:57,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:48:57,243 INFO L495 AbstractCegarLoop]: Abstraction has 1310 states and 4230 transitions. [2022-11-18 18:48:57,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:57,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 4230 transitions. [2022-11-18 18:48:57,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 18:48:57,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:48:57,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:48:57,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 18:48:57,244 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:48:57,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:48:57,245 INFO L85 PathProgramCache]: Analyzing trace with hash -257455581, now seen corresponding path program 1 times [2022-11-18 18:48:57,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:48:57,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571025512] [2022-11-18 18:48:57,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:48:57,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:48:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:48:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:48:57,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:48:57,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571025512] [2022-11-18 18:48:57,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571025512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:48:57,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:48:57,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 18:48:57,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911493481] [2022-11-18 18:48:57,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:48:57,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:48:57,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:48:57,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:48:57,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:48:57,643 INFO L87 Difference]: Start difference. First operand 1310 states and 4230 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:57,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:48:57,899 INFO L93 Difference]: Finished difference Result 1330 states and 4156 transitions. [2022-11-18 18:48:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:48:57,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-18 18:48:57,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:48:57,907 INFO L225 Difference]: With dead ends: 1330 [2022-11-18 18:48:57,907 INFO L226 Difference]: Without dead ends: 1150 [2022-11-18 18:48:57,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:48:57,908 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:48:57,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 30 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:48:57,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2022-11-18 18:48:57,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1078. [2022-11-18 18:48:57,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1076 states have (on average 3.1654275092936803) internal successors, (3406), 1077 states have internal predecessors, (3406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 3406 transitions. [2022-11-18 18:48:57,947 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 3406 transitions. Word has length 10 [2022-11-18 18:48:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:48:57,948 INFO L495 AbstractCegarLoop]: Abstraction has 1078 states and 3406 transitions. [2022-11-18 18:48:57,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 3406 transitions. [2022-11-18 18:48:57,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 18:48:57,950 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:48:57,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:48:57,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 18:48:57,950 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:48:57,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:48:57,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1691146040, now seen corresponding path program 1 times [2022-11-18 18:48:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:48:57,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526807296] [2022-11-18 18:48:57,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:48:57,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:48:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:48:58,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:48:58,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:48:58,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526807296] [2022-11-18 18:48:58,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526807296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:48:58,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:48:58,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 18:48:58,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600676262] [2022-11-18 18:48:58,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:48:58,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:48:58,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:48:58,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:48:58,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:48:58,333 INFO L87 Difference]: Start difference. First operand 1078 states and 3406 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:58,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:48:58,543 INFO L93 Difference]: Finished difference Result 958 states and 3000 transitions. [2022-11-18 18:48:58,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:48:58,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-18 18:48:58,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:48:58,549 INFO L225 Difference]: With dead ends: 958 [2022-11-18 18:48:58,549 INFO L226 Difference]: Without dead ends: 757 [2022-11-18 18:48:58,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:48:58,550 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 39 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:48:58,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 36 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:48:58,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2022-11-18 18:48:58,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2022-11-18 18:48:58,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 756 states have (on average 3.0462962962962963) internal successors, (2303), 756 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 2303 transitions. [2022-11-18 18:48:58,577 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 2303 transitions. Word has length 12 [2022-11-18 18:48:58,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:48:58,578 INFO L495 AbstractCegarLoop]: Abstraction has 757 states and 2303 transitions. [2022-11-18 18:48:58,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 2303 transitions. [2022-11-18 18:48:58,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 18:48:58,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:48:58,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:48:58,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 18:48:58,580 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:48:58,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:48:58,580 INFO L85 PathProgramCache]: Analyzing trace with hash -766030648, now seen corresponding path program 1 times [2022-11-18 18:48:58,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:48:58,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88682451] [2022-11-18 18:48:58,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:48:58,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:48:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:48:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:48:58,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:48:58,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88682451] [2022-11-18 18:48:58,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88682451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:48:58,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:48:58,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:48:58,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303753650] [2022-11-18 18:48:58,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:48:58,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:48:58,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:48:58,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:48:58,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:48:58,725 INFO L87 Difference]: Start difference. First operand 757 states and 2303 transitions. Second operand has 4 states, 4 states have (on average 3.25) 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-18 18:48:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:48:58,862 INFO L93 Difference]: Finished difference Result 702 states and 1882 transitions. [2022-11-18 18:48:58,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:48:58,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) 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-18 18:48:58,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:48:58,866 INFO L225 Difference]: With dead ends: 702 [2022-11-18 18:48:58,866 INFO L226 Difference]: Without dead ends: 501 [2022-11-18 18:48:58,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:48:58,867 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 36 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:48:58,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 15 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:48:58,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-11-18 18:48:58,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2022-11-18 18:48:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 2.574) internal successors, (1287), 500 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1287 transitions. [2022-11-18 18:48:58,887 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 1287 transitions. Word has length 13 [2022-11-18 18:48:58,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:48:58,888 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 1287 transitions. [2022-11-18 18:48:58,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) 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-18 18:48:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 1287 transitions. [2022-11-18 18:48:58,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 18:48:58,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:48:58,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:48:58,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 18:48:58,890 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:48:58,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:48:58,890 INFO L85 PathProgramCache]: Analyzing trace with hash 47219207, now seen corresponding path program 1 times [2022-11-18 18:48:58,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:48:58,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517680264] [2022-11-18 18:48:58,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:48:58,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:48:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:48:59,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:48:59,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:48:59,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517680264] [2022-11-18 18:48:59,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517680264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:48:59,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:48:59,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 18:48:59,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553731213] [2022-11-18 18:48:59,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:48:59,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:48:59,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:48:59,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:48:59,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:48:59,188 INFO L87 Difference]: Start difference. First operand 501 states and 1287 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:48:59,350 INFO L93 Difference]: Finished difference Result 411 states and 985 transitions. [2022-11-18 18:48:59,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:48:59,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-18 18:48:59,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:48:59,352 INFO L225 Difference]: With dead ends: 411 [2022-11-18 18:48:59,352 INFO L226 Difference]: Without dead ends: 320 [2022-11-18 18:48:59,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:48:59,353 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 66 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:48:59,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 20 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:48:59,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-11-18 18:48:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 317. [2022-11-18 18:48:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 2.3544303797468356) internal successors, (744), 316 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 744 transitions. [2022-11-18 18:48:59,363 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 744 transitions. Word has length 16 [2022-11-18 18:48:59,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:48:59,363 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 744 transitions. [2022-11-18 18:48:59,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 744 transitions. [2022-11-18 18:48:59,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-18 18:48:59,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:48:59,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:48:59,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 18:48:59,365 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:48:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:48:59,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2059422610, now seen corresponding path program 1 times [2022-11-18 18:48:59,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:48:59,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233858375] [2022-11-18 18:48:59,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:48:59,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:48:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:48:59,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:48:59,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:48:59,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233858375] [2022-11-18 18:48:59,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233858375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:48:59,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:48:59,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:48:59,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746996986] [2022-11-18 18:48:59,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:48:59,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:48:59,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:48:59,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:48:59,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:48:59,719 INFO L87 Difference]: Start difference. First operand 317 states and 744 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-18 18:48:59,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:48:59,870 INFO L93 Difference]: Finished difference Result 292 states and 693 transitions. [2022-11-18 18:48:59,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 18:48:59,871 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-18 18:48:59,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:48:59,872 INFO L225 Difference]: With dead ends: 292 [2022-11-18 18:48:59,873 INFO L226 Difference]: Without dead ends: 257 [2022-11-18 18:48:59,873 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-18 18:48:59,874 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 57 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:48:59,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 17 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:48:59,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-11-18 18:48:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 239. [2022-11-18 18:48:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 2.4159663865546217) internal successors, (575), 238 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:48:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 575 transitions. [2022-11-18 18:48:59,882 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 575 transitions. Word has length 19 [2022-11-18 18:48:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:48:59,882 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 575 transitions. [2022-11-18 18:48:59,883 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-18 18:48:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 575 transitions. [2022-11-18 18:48:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 18:48:59,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:48:59,885 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] [2022-11-18 18:48:59,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 18:48:59,885 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:48:59,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:48:59,885 INFO L85 PathProgramCache]: Analyzing trace with hash 406852699, now seen corresponding path program 1 times [2022-11-18 18:48:59,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:48:59,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277139801] [2022-11-18 18:48:59,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:48:59,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:48:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:49:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:49:00,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:49:00,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277139801] [2022-11-18 18:49:00,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277139801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:49:00,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:49:00,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:49:00,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925297717] [2022-11-18 18:49:00,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:49:00,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:49:00,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:49:00,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:49:00,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:49:00,639 INFO L87 Difference]: Start difference. First operand 239 states and 575 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:49:00,891 INFO L93 Difference]: Finished difference Result 411 states and 984 transitions. [2022-11-18 18:49:00,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 18:49:00,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-18 18:49:00,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:49:00,894 INFO L225 Difference]: With dead ends: 411 [2022-11-18 18:49:00,894 INFO L226 Difference]: Without dead ends: 291 [2022-11-18 18:49:00,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:49:00,895 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 39 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:49:00,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 36 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:49:00,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-11-18 18:49:00,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2022-11-18 18:49:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 2.3689655172413793) internal successors, (687), 290 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 687 transitions. [2022-11-18 18:49:00,903 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 687 transitions. Word has length 23 [2022-11-18 18:49:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:49:00,904 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 687 transitions. [2022-11-18 18:49:00,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 687 transitions. [2022-11-18 18:49:00,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 18:49:00,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:49:00,905 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] [2022-11-18 18:49:00,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 18:49:00,905 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:49:00,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:49:00,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1599240905, now seen corresponding path program 2 times [2022-11-18 18:49:00,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:49:00,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506784500] [2022-11-18 18:49:00,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:49:00,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:49:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:49:01,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:49:01,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:49:01,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506784500] [2022-11-18 18:49:01,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506784500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:49:01,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:49:01,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:49:01,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272121884] [2022-11-18 18:49:01,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:49:01,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:49:01,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:49:01,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:49:01,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:49:01,140 INFO L87 Difference]: Start difference. First operand 291 states and 687 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:01,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:49:01,227 INFO L93 Difference]: Finished difference Result 401 states and 931 transitions. [2022-11-18 18:49:01,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 18:49:01,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-18 18:49:01,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:49:01,229 INFO L225 Difference]: With dead ends: 401 [2022-11-18 18:49:01,229 INFO L226 Difference]: Without dead ends: 239 [2022-11-18 18:49:01,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:49:01,230 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:49:01,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 4 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:49:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-11-18 18:49:01,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2022-11-18 18:49:01,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 2.2941176470588234) internal successors, (546), 238 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 546 transitions. [2022-11-18 18:49:01,237 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 546 transitions. Word has length 23 [2022-11-18 18:49:01,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:49:01,237 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 546 transitions. [2022-11-18 18:49:01,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:01,237 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 546 transitions. [2022-11-18 18:49:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 18:49:01,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:49:01,238 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] [2022-11-18 18:49:01,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 18:49:01,239 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:49:01,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:49:01,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1507990987, now seen corresponding path program 3 times [2022-11-18 18:49:01,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:49:01,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572415033] [2022-11-18 18:49:01,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:49:01,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:49:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:49:01,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:49:01,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:49:01,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572415033] [2022-11-18 18:49:01,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572415033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:49:01,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:49:01,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:49:01,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762241457] [2022-11-18 18:49:01,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:49:01,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:49:01,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:49:01,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:49:01,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:49:01,472 INFO L87 Difference]: Start difference. First operand 239 states and 546 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:49:01,574 INFO L93 Difference]: Finished difference Result 322 states and 728 transitions. [2022-11-18 18:49:01,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 18:49:01,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-18 18:49:01,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:49:01,576 INFO L225 Difference]: With dead ends: 322 [2022-11-18 18:49:01,576 INFO L226 Difference]: Without dead ends: 116 [2022-11-18 18:49:01,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:49:01,576 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:49:01,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 7 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:49:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-18 18:49:01,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-11-18 18:49:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 2.1130434782608694) internal successors, (243), 115 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 243 transitions. [2022-11-18 18:49:01,580 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 243 transitions. Word has length 23 [2022-11-18 18:49:01,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:49:01,581 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 243 transitions. [2022-11-18 18:49:01,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:01,581 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 243 transitions. [2022-11-18 18:49:01,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 18:49:01,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:49:01,582 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] [2022-11-18 18:49:01,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 18:49:01,582 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:49:01,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:49:01,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1484357081, now seen corresponding path program 4 times [2022-11-18 18:49:01,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:49:01,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073248238] [2022-11-18 18:49:01,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:49:01,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:49:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:49:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:49:02,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:49:02,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073248238] [2022-11-18 18:49:02,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073248238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:49:02,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:49:02,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:49:02,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298948710] [2022-11-18 18:49:02,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:49:02,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:49:02,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:49:02,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:49:02,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:49:02,352 INFO L87 Difference]: Start difference. First operand 116 states and 243 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:49:02,576 INFO L93 Difference]: Finished difference Result 136 states and 278 transitions. [2022-11-18 18:49:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 18:49:02,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-18 18:49:02,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:49:02,578 INFO L225 Difference]: With dead ends: 136 [2022-11-18 18:49:02,578 INFO L226 Difference]: Without dead ends: 70 [2022-11-18 18:49:02,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-18 18:49:02,579 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 50 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:49:02,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 18 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:49:02,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-18 18:49:02,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-18 18:49:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.7826086956521738) internal successors, (123), 69 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 123 transitions. [2022-11-18 18:49:02,583 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 123 transitions. Word has length 23 [2022-11-18 18:49:02,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:49:02,584 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 123 transitions. [2022-11-18 18:49:02,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:02,584 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 123 transitions. [2022-11-18 18:49:02,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 18:49:02,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:49:02,585 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] [2022-11-18 18:49:02,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 18:49:02,585 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:49:02,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:49:02,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1064266073, now seen corresponding path program 5 times [2022-11-18 18:49:02,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:49:02,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522371907] [2022-11-18 18:49:02,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:49:02,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:49:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:49:02,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 18:49:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:49:02,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 18:49:02,745 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 18:49:02,746 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-18 18:49:02,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-18 18:49:02,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-18 18:49:02,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-18 18:49:02,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-18 18:49:02,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-18 18:49:02,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-18 18:49:02,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-18 18:49:02,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-18 18:49:02,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-18 18:49:02,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-18 18:49:02,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-18 18:49:02,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-18 18:49:02,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 18:49:02,753 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:49:02,759 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 18:49:02,759 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 18:49:02,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 06:49:02 BasicIcfg [2022-11-18 18:49:02,825 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 18:49:02,825 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 18:49:02,825 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 18:49:02,826 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 18:49:02,826 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:48:49" (3/4) ... [2022-11-18 18:49:02,829 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 18:49:02,829 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 18:49:02,830 INFO L158 Benchmark]: Toolchain (without parser) took 15715.11ms. Allocated memory was 104.9MB in the beginning and 222.3MB in the end (delta: 117.4MB). Free memory was 73.0MB in the beginning and 79.3MB in the end (delta: -6.3MB). Peak memory consumption was 110.6MB. Max. memory is 16.1GB. [2022-11-18 18:49:02,830 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 104.9MB. Free memory was 58.5MB in the beginning and 58.5MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 18:49:02,830 INFO L158 Benchmark]: CACSL2BoogieTranslator took 695.78ms. Allocated memory is still 104.9MB. Free memory was 72.8MB in the beginning and 67.7MB in the end (delta: 5.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 18:49:02,831 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.51ms. Allocated memory is still 104.9MB. Free memory was 67.7MB in the beginning and 65.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 18:49:02,831 INFO L158 Benchmark]: Boogie Preprocessor took 66.18ms. Allocated memory is still 104.9MB. Free memory was 65.2MB in the beginning and 63.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 18:49:02,831 INFO L158 Benchmark]: RCFGBuilder took 1095.76ms. Allocated memory was 104.9MB in the beginning and 142.6MB in the end (delta: 37.7MB). Free memory was 63.1MB in the beginning and 95.1MB in the end (delta: -32.0MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2022-11-18 18:49:02,832 INFO L158 Benchmark]: TraceAbstraction took 13774.44ms. Allocated memory was 142.6MB in the beginning and 222.3MB in the end (delta: 79.7MB). Free memory was 95.1MB in the beginning and 79.3MB in the end (delta: 15.8MB). Peak memory consumption was 95.5MB. Max. memory is 16.1GB. [2022-11-18 18:49:02,832 INFO L158 Benchmark]: Witness Printer took 3.89ms. Allocated memory is still 222.3MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 18:49:02,834 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 104.9MB. Free memory was 58.5MB in the beginning and 58.5MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 695.78ms. Allocated memory is still 104.9MB. Free memory was 72.8MB in the beginning and 67.7MB in the end (delta: 5.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.51ms. Allocated memory is still 104.9MB. Free memory was 67.7MB in the beginning and 65.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.18ms. Allocated memory is still 104.9MB. Free memory was 65.2MB in the beginning and 63.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1095.76ms. Allocated memory was 104.9MB in the beginning and 142.6MB in the end (delta: 37.7MB). Free memory was 63.1MB in the beginning and 95.1MB in the end (delta: -32.0MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13774.44ms. Allocated memory was 142.6MB in the beginning and 222.3MB in the end (delta: 79.7MB). Free memory was 95.1MB in the beginning and 79.3MB in the end (delta: 15.8MB). Peak memory consumption was 95.5MB. Max. memory is 16.1GB. * Witness Printer took 3.89ms. Allocated memory is still 222.3MB. Free memory is still 79.3MB. 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: 5.7s, 139 PlacesBefore, 46 PlacesAfterwards, 131 TransitionsBefore, 37 TransitionsAfterwards, 2698 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 126 TotalNumberOfCompositions, 7665 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3404, independent: 3195, independent conditional: 0, independent unconditional: 3195, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1802, independent: 1750, independent conditional: 0, independent unconditional: 1750, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1802, independent: 1721, independent conditional: 0, independent unconditional: 1721, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 81, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 401, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 352, dependent conditional: 0, dependent unconditional: 352, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3404, independent: 1445, independent conditional: 0, independent unconditional: 1445, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 1802, unknown conditional: 0, unknown unconditional: 1802] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 189, Positive conditional cache size: 0, Positive unconditional cache size: 189, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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: [L717] 0 int __unbuffered_p2_EBX = 0; [L735] 0 _Bool a$w_buff1_used; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L711] 0 int __unbuffered_p0_EAX = 0; [L721] 0 int a$mem_tmp; [L730] 0 _Bool a$read_delayed; [L719] 0 int a = 0; [L729] 0 _Bool a$r_buff1_thd3; [L715] 0 int __unbuffered_p2_EAX = 0; [L727] 0 _Bool a$r_buff1_thd1; [L732] 0 int a$w_buff0; [L728] 0 _Bool a$r_buff1_thd2; [L734] 0 int a$w_buff1; [L720] 0 _Bool a$flush_delayed; [L726] 0 _Bool a$r_buff1_thd0; [L709] 0 int __unbuffered_cnt = 0; [L731] 0 int *a$read_delayed_var; [L713] 0 int __unbuffered_p0_EBX = 0; [L737] 0 _Bool main$tmp_guard1; [L736] 0 _Bool main$tmp_guard0; [L733] 0 _Bool a$w_buff0_used; [L723] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff0_thd2; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L848] 0 pthread_t t633; [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t633, ((void *)0), P0, ((void *)0))=-1, t633={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t634; [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t634, ((void *)0), P1, ((void *)0))=0, t633={5:0}, t634={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t635; [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t635, ((void *)0), P2, ((void *)0))=1, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 [L764] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L767] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L787] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L807] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=1, z=2] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=1, z=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice0=56, weak$$choice2=255, x=1, y=1, z=2] [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L868] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=1, z=2] - 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: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 849]: 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: 853]: 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 7 procedures, 161 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 427 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 427 mSDsluCounter, 201 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1338 IncrementalHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 68 mSDtfsCounter, 1338 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1492occurred in iteration=0, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 961 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 1362 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-18 18:49:02,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 18:49:05,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 18:49:05,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 18:49:05,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 18:49:05,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 18:49:05,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 18:49:05,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 18:49:05,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 18:49:05,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 18:49:05,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 18:49:05,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 18:49:05,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 18:49:05,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 18:49:05,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 18:49:05,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 18:49:05,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 18:49:05,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 18:49:05,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 18:49:05,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 18:49:05,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 18:49:05,269 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 18:49:05,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 18:49:05,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 18:49:05,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 18:49:05,276 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 18:49:05,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 18:49:05,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 18:49:05,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 18:49:05,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 18:49:05,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 18:49:05,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 18:49:05,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 18:49:05,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 18:49:05,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 18:49:05,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 18:49:05,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 18:49:05,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 18:49:05,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 18:49:05,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 18:49:05,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 18:49:05,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 18:49:05,288 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-18 18:49:05,320 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 18:49:05,321 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 18:49:05,321 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 18:49:05,322 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 18:49:05,322 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 18:49:05,323 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 18:49:05,323 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 18:49:05,324 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 18:49:05,324 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 18:49:05,324 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 18:49:05,324 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 18:49:05,325 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 18:49:05,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 18:49:05,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 18:49:05,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 18:49:05,325 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 18:49:05,326 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 18:49:05,326 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 18:49:05,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 18:49:05,326 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 18:49:05,327 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 18:49:05,327 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 18:49:05,327 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 18:49:05,327 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 18:49:05,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 18:49:05,328 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 18:49:05,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 18:49:05,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:49:05,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 18:49:05,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 18:49:05,329 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 18:49:05,329 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 18:49:05,329 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 18:49:05,330 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_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 [2022-11-18 18:49:05,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 18:49:05,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 18:49:05,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 18:49:05,784 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 18:49:05,791 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 18:49:05,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-18 18:49:05,877 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/data/a11797b0b/e57f6112c3464de5ad25420bfef87cca/FLAG566dff459 [2022-11-18 18:49:06,491 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 18:49:06,491 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-18 18:49:06,508 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/data/a11797b0b/e57f6112c3464de5ad25420bfef87cca/FLAG566dff459 [2022-11-18 18:49:06,791 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/data/a11797b0b/e57f6112c3464de5ad25420bfef87cca [2022-11-18 18:49:06,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 18:49:06,795 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 18:49:06,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 18:49:06,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 18:49:06,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 18:49:06,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:49:06" (1/1) ... [2022-11-18 18:49:06,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b3ad206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:49:06, skipping insertion in model container [2022-11-18 18:49:06,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:49:06" (1/1) ... [2022-11-18 18:49:06,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 18:49:06,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 18:49:07,048 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2022-11-18 18:49:07,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:49:07,402 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 18:49:07,419 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2022-11-18 18:49:07,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:49:07,550 INFO L208 MainTranslator]: Completed translation [2022-11-18 18:49:07,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:49:07 WrapperNode [2022-11-18 18:49:07,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 18:49:07,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 18:49:07,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 18:49:07,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 18:49:07,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:49:07" (1/1) ... [2022-11-18 18:49:07,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:49:07" (1/1) ... [2022-11-18 18:49:07,641 INFO L138 Inliner]: procedures = 179, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2022-11-18 18:49:07,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 18:49:07,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 18:49:07,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 18:49:07,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 18:49:07,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:49:07" (1/1) ... [2022-11-18 18:49:07,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:49:07" (1/1) ... [2022-11-18 18:49:07,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:49:07" (1/1) ... [2022-11-18 18:49:07,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:49:07" (1/1) ... [2022-11-18 18:49:07,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:49:07" (1/1) ... [2022-11-18 18:49:07,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:49:07" (1/1) ... [2022-11-18 18:49:07,714 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:49:07" (1/1) ... [2022-11-18 18:49:07,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:49:07" (1/1) ... [2022-11-18 18:49:07,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 18:49:07,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 18:49:07,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 18:49:07,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 18:49:07,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:49:07" (1/1) ... [2022-11-18 18:49:07,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:49:07,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:49:07,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 18:49:07,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 18:49:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 18:49:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 18:49:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 18:49:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 18:49:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-18 18:49:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 18:49:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 18:49:07,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 18:49:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 18:49:07,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 18:49:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 18:49:07,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 18:49:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 18:49:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 18:49:07,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 18:49:07,819 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 18:49:08,043 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 18:49:08,046 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 18:49:08,582 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 18:49:08,792 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 18:49:08,793 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 18:49:08,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:49:08 BoogieIcfgContainer [2022-11-18 18:49:08,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 18:49:08,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 18:49:08,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 18:49:08,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 18:49:08,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:49:06" (1/3) ... [2022-11-18 18:49:08,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e4b84f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:49:08, skipping insertion in model container [2022-11-18 18:49:08,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:49:07" (2/3) ... [2022-11-18 18:49:08,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e4b84f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:49:08, skipping insertion in model container [2022-11-18 18:49:08,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:49:08" (3/3) ... [2022-11-18 18:49:08,807 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-18 18:49:08,826 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 18:49:08,826 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-18 18:49:08,826 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 18:49:08,940 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 18:49:08,994 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 18:49:09,017 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 132 transitions, 279 flow [2022-11-18 18:49:09,020 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 132 transitions, 279 flow [2022-11-18 18:49:09,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 132 transitions, 279 flow [2022-11-18 18:49:09,077 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-11-18 18:49:09,078 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 18:49:09,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2022-11-18 18:49:09,086 INFO L119 LiptonReduction]: Number of co-enabled transitions 2698 [2022-11-18 18:49:18,800 INFO L134 LiptonReduction]: Checked pairs total: 7683 [2022-11-18 18:49:18,800 INFO L136 LiptonReduction]: Total number of compositions: 128 [2022-11-18 18:49:18,809 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 37 transitions, 89 flow [2022-11-18 18:49:18,910 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1492 states, 1477 states have (on average 3.3947190250507786) internal successors, (5014), 1491 states have internal predecessors, (5014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:18,929 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:49:18,936 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;@49f6987b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:49:18,936 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-18 18:49:18,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 1492 states, 1477 states have (on average 3.3947190250507786) internal successors, (5014), 1491 states have internal predecessors, (5014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 18:49:18,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:49:18,950 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 18:49:18,951 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:49:18,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:49:18,960 INFO L85 PathProgramCache]: Analyzing trace with hash 562, now seen corresponding path program 1 times [2022-11-18 18:49:18,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:49:18,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365706290] [2022-11-18 18:49:18,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:49:18,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:49:18,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:49:18,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:49:18,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-18 18:49:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:49:19,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 18:49:19,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:49:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:49:19,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:49:19,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:49:19,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365706290] [2022-11-18 18:49:19,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365706290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:49:19,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:49:19,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 18:49:19,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921833205] [2022-11-18 18:49:19,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:49:19,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 18:49:19,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:49:19,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 18:49:19,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 18:49:19,149 INFO L87 Difference]: Start difference. First operand has 1492 states, 1477 states have (on average 3.3947190250507786) internal successors, (5014), 1491 states have internal predecessors, (5014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:19,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:49:19,401 INFO L93 Difference]: Finished difference Result 1406 states and 4590 transitions. [2022-11-18 18:49:19,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 18:49:19,403 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-18 18:49:19,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:49:19,434 INFO L225 Difference]: With dead ends: 1406 [2022-11-18 18:49:19,434 INFO L226 Difference]: Without dead ends: 1406 [2022-11-18 18:49:19,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 18:49:19,438 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:49:19,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:49:19,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2022-11-18 18:49:19,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1406. [2022-11-18 18:49:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1401 states have (on average 3.2762312633832975) internal successors, (4590), 1405 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 4590 transitions. [2022-11-18 18:49:19,603 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 4590 transitions. Word has length 1 [2022-11-18 18:49:19,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:49:19,604 INFO L495 AbstractCegarLoop]: Abstraction has 1406 states and 4590 transitions. [2022-11-18 18:49:19,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 4590 transitions. [2022-11-18 18:49:19,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 18:49:19,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:49:19,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 18:49:19,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-18 18:49:19,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:49:19,811 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:49:19,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:49:19,812 INFO L85 PathProgramCache]: Analyzing trace with hash 552062, now seen corresponding path program 1 times [2022-11-18 18:49:19,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:49:19,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761512830] [2022-11-18 18:49:19,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:49:19,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:49:19,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:49:19,814 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:49:19,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-18 18:49:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:49:19,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 18:49:19,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:49:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:49:19,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:49:19,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:49:19,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761512830] [2022-11-18 18:49:19,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761512830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:49:19,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:49:19,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 18:49:19,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944957704] [2022-11-18 18:49:19,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:49:19,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:49:19,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:49:19,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:49:19,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:49:19,947 INFO L87 Difference]: Start difference. First operand 1406 states and 4590 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:49:20,084 INFO L93 Difference]: Finished difference Result 1184 states and 3825 transitions. [2022-11-18 18:49:20,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:49:20,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-18 18:49:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:49:20,095 INFO L225 Difference]: With dead ends: 1184 [2022-11-18 18:49:20,095 INFO L226 Difference]: Without dead ends: 1154 [2022-11-18 18:49:20,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:49:20,097 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:49:20,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 6 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:49:20,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2022-11-18 18:49:20,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1154. [2022-11-18 18:49:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1152 states have (on average 3.251736111111111) internal successors, (3746), 1153 states have internal predecessors, (3746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:20,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 3746 transitions. [2022-11-18 18:49:20,152 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 3746 transitions. Word has length 3 [2022-11-18 18:49:20,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:49:20,180 INFO L495 AbstractCegarLoop]: Abstraction has 1154 states and 3746 transitions. [2022-11-18 18:49:20,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 3746 transitions. [2022-11-18 18:49:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 18:49:20,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:49:20,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:49:20,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-18 18:49:20,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:49:20,382 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:49:20,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:49:20,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1598202281, now seen corresponding path program 1 times [2022-11-18 18:49:20,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:49:20,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503539158] [2022-11-18 18:49:20,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:49:20,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:49:20,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:49:20,387 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:49:20,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-18 18:49:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:49:20,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 18:49:20,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:49:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:49:20,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:49:20,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:49:20,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503539158] [2022-11-18 18:49:20,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503539158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:49:20,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:49:20,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:49:20,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371955652] [2022-11-18 18:49:20,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:49:20,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:49:20,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:49:20,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:49:20,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:49:20,642 INFO L87 Difference]: Start difference. First operand 1154 states and 3746 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:20,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:49:20,880 INFO L93 Difference]: Finished difference Result 834 states and 2290 transitions. [2022-11-18 18:49:20,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:49:20,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-18 18:49:20,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:49:20,885 INFO L225 Difference]: With dead ends: 834 [2022-11-18 18:49:20,885 INFO L226 Difference]: Without dead ends: 654 [2022-11-18 18:49:20,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:49:20,887 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 40 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:49:20,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 15 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:49:20,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-11-18 18:49:20,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2022-11-18 18:49:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 652 states have (on average 2.6779141104294477) internal successors, (1746), 653 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1746 transitions. [2022-11-18 18:49:20,912 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1746 transitions. Word has length 9 [2022-11-18 18:49:20,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:49:20,912 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 1746 transitions. [2022-11-18 18:49:20,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1746 transitions. [2022-11-18 18:49:20,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 18:49:20,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:49:20,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:49:20,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-18 18:49:21,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:49:21,135 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:49:21,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:49:21,136 INFO L85 PathProgramCache]: Analyzing trace with hash 516816390, now seen corresponding path program 1 times [2022-11-18 18:49:21,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:49:21,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865327281] [2022-11-18 18:49:21,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:49:21,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:49:21,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:49:21,139 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:49:21,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-18 18:49:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:49:21,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 18:49:21,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:49:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:49:21,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:49:21,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:49:21,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865327281] [2022-11-18 18:49:21,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865327281] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:49:21,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:49:21,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 18:49:21,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879424216] [2022-11-18 18:49:21,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:49:21,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:49:21,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:49:21,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:49:21,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:49:21,373 INFO L87 Difference]: Start difference. First operand 654 states and 1746 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:49:21,648 INFO L93 Difference]: Finished difference Result 409 states and 980 transitions. [2022-11-18 18:49:21,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:49:21,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-18 18:49:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:49:21,651 INFO L225 Difference]: With dead ends: 409 [2022-11-18 18:49:21,651 INFO L226 Difference]: Without dead ends: 329 [2022-11-18 18:49:21,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:49:21,653 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 52 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:49:21,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 27 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:49:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-11-18 18:49:21,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2022-11-18 18:49:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 327 states have (on average 2.3577981651376145) internal successors, (771), 328 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 771 transitions. [2022-11-18 18:49:21,670 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 771 transitions. Word has length 13 [2022-11-18 18:49:21,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:49:21,671 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 771 transitions. [2022-11-18 18:49:21,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:21,671 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 771 transitions. [2022-11-18 18:49:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 18:49:21,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:49:21,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:49:21,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-18 18:49:21,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:49:21,891 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:49:21,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:49:21,892 INFO L85 PathProgramCache]: Analyzing trace with hash -755877923, now seen corresponding path program 1 times [2022-11-18 18:49:21,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:49:21,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646962607] [2022-11-18 18:49:21,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:49:21,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:49:21,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:49:21,894 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:49:21,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-18 18:49:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:49:22,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 18:49:22,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:49:22,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:49:22,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:49:22,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:49:22,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646962607] [2022-11-18 18:49:22,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646962607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:49:22,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:49:22,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:49:22,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408841758] [2022-11-18 18:49:22,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:49:22,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:49:22,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:49:22,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:49:22,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:49:22,097 INFO L87 Difference]: Start difference. First operand 329 states and 771 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:22,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:49:22,405 INFO L93 Difference]: Finished difference Result 274 states and 659 transitions. [2022-11-18 18:49:22,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 18:49:22,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-18 18:49:22,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:49:22,407 INFO L225 Difference]: With dead ends: 274 [2022-11-18 18:49:22,407 INFO L226 Difference]: Without dead ends: 259 [2022-11-18 18:49:22,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-18 18:49:22,409 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 47 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 18:49:22,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 45 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 18:49:22,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-11-18 18:49:22,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2022-11-18 18:49:22,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 257 states have (on average 2.455252918287938) internal successors, (631), 258 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 631 transitions. [2022-11-18 18:49:22,418 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 631 transitions. Word has length 18 [2022-11-18 18:49:22,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:49:22,419 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 631 transitions. [2022-11-18 18:49:22,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:22,419 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 631 transitions. [2022-11-18 18:49:22,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 18:49:22,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:49:22,421 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] [2022-11-18 18:49:22,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-18 18:49:22,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:49:22,634 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:49:22,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:49:22,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2048175231, now seen corresponding path program 1 times [2022-11-18 18:49:22,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:49:22,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764443122] [2022-11-18 18:49:22,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:49:22,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:49:22,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:49:22,637 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:49:22,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-18 18:49:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:49:22,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 18:49:22,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:49:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:49:22,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:49:22,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:49:22,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764443122] [2022-11-18 18:49:22,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764443122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:49:22,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:49:22,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:49:22,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796339976] [2022-11-18 18:49:22,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:49:22,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:49:22,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:49:22,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:49:22,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:49:22,811 INFO L87 Difference]: Start difference. First operand 259 states and 631 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:22,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:49:22,936 INFO L93 Difference]: Finished difference Result 353 states and 842 transitions. [2022-11-18 18:49:22,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:49:22,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-18 18:49:22,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:49:22,938 INFO L225 Difference]: With dead ends: 353 [2022-11-18 18:49:22,938 INFO L226 Difference]: Without dead ends: 353 [2022-11-18 18:49:22,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:49:22,939 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:49:22,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 5 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:49:22,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-11-18 18:49:22,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2022-11-18 18:49:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 349 states have (on average 2.4097421203438394) internal successors, (841), 350 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:22,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 841 transitions. [2022-11-18 18:49:22,951 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 841 transitions. Word has length 23 [2022-11-18 18:49:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:49:22,952 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 841 transitions. [2022-11-18 18:49:22,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:49:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 841 transitions. [2022-11-18 18:49:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 18:49:22,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:49:22,954 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] [2022-11-18 18:49:22,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-18 18:49:23,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:49:23,167 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-18 18:49:23,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:49:23,167 INFO L85 PathProgramCache]: Analyzing trace with hash -429926189, now seen corresponding path program 2 times [2022-11-18 18:49:23,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:49:23,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805760099] [2022-11-18 18:49:23,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 18:49:23,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:49:23,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:49:23,169 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 18:49:23,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-18 18:49:23,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 18:49:23,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-18 18:49:23,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 18:49:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:49:23,507 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-18 18:49:23,507 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 18:49:23,508 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-18 18:49:23,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-18 18:49:23,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-18 18:49:23,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-18 18:49:23,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-18 18:49:23,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-18 18:49:23,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-18 18:49:23,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-18 18:49:23,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-18 18:49:23,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-18 18:49:23,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-18 18:49:23,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-18 18:49:23,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-18 18:49:23,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-18 18:49:23,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:49:23,735 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-11-18 18:49:23,739 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 18:49:23,739 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 18:49:23,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 06:49:23 BasicIcfg [2022-11-18 18:49:23,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 18:49:23,822 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 18:49:23,822 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 18:49:23,822 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 18:49:23,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:49:08" (3/4) ... [2022-11-18 18:49:23,826 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 18:49:23,826 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 18:49:23,827 INFO L158 Benchmark]: Toolchain (without parser) took 17031.50ms. Allocated memory was 60.8MB in the beginning and 123.7MB in the end (delta: 62.9MB). Free memory was 38.4MB in the beginning and 57.5MB in the end (delta: -19.0MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2022-11-18 18:49:23,827 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 60.8MB. Free memory was 42.1MB in the beginning and 42.1MB in the end (delta: 50.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 18:49:23,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 755.36ms. Allocated memory is still 60.8MB. Free memory was 38.2MB in the beginning and 31.7MB in the end (delta: 6.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 18:49:23,828 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.96ms. Allocated memory is still 60.8MB. Free memory was 31.7MB in the beginning and 29.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 18:49:23,828 INFO L158 Benchmark]: Boogie Preprocessor took 77.49ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 29.2MB in the beginning and 64.3MB in the end (delta: -35.1MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2022-11-18 18:49:23,828 INFO L158 Benchmark]: RCFGBuilder took 1075.14ms. Allocated memory is still 81.8MB. Free memory was 64.3MB in the beginning and 42.0MB in the end (delta: 22.3MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2022-11-18 18:49:23,829 INFO L158 Benchmark]: TraceAbstraction took 15021.91ms. Allocated memory was 81.8MB in the beginning and 123.7MB in the end (delta: 41.9MB). Free memory was 41.1MB in the beginning and 58.5MB in the end (delta: -17.4MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2022-11-18 18:49:23,829 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 123.7MB. Free memory was 58.5MB in the beginning and 57.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 18:49:23,831 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.34ms. Allocated memory is still 60.8MB. Free memory was 42.1MB in the beginning and 42.1MB in the end (delta: 50.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 755.36ms. Allocated memory is still 60.8MB. Free memory was 38.2MB in the beginning and 31.7MB in the end (delta: 6.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.96ms. Allocated memory is still 60.8MB. Free memory was 31.7MB in the beginning and 29.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.49ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 29.2MB in the beginning and 64.3MB in the end (delta: -35.1MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1075.14ms. Allocated memory is still 81.8MB. Free memory was 64.3MB in the beginning and 42.0MB in the end (delta: 22.3MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15021.91ms. Allocated memory was 81.8MB in the beginning and 123.7MB in the end (delta: 41.9MB). Free memory was 41.1MB in the beginning and 58.5MB in the end (delta: -17.4MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 123.7MB. Free memory was 58.5MB in the beginning and 57.5MB 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: 9.8s, 140 PlacesBefore, 46 PlacesAfterwards, 132 TransitionsBefore, 37 TransitionsAfterwards, 2698 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 128 TotalNumberOfCompositions, 7683 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3211, independent: 3004, independent conditional: 0, independent unconditional: 3004, dependent: 207, dependent conditional: 0, dependent unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1809, independent: 1751, independent conditional: 0, independent unconditional: 1751, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1809, independent: 1731, independent conditional: 0, independent unconditional: 1731, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 78, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 500, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 458, dependent conditional: 0, dependent unconditional: 458, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3211, independent: 1253, independent conditional: 0, independent unconditional: 1253, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 1809, unknown conditional: 0, unknown unconditional: 1809] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 202, Positive conditional cache size: 0, Positive unconditional cache size: 202, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, 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: [L717] 0 int __unbuffered_p2_EBX = 0; [L735] 0 _Bool a$w_buff1_used; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L711] 0 int __unbuffered_p0_EAX = 0; [L721] 0 int a$mem_tmp; [L730] 0 _Bool a$read_delayed; [L719] 0 int a = 0; [L729] 0 _Bool a$r_buff1_thd3; [L715] 0 int __unbuffered_p2_EAX = 0; [L727] 0 _Bool a$r_buff1_thd1; [L732] 0 int a$w_buff0; [L728] 0 _Bool a$r_buff1_thd2; [L734] 0 int a$w_buff1; [L720] 0 _Bool a$flush_delayed; [L726] 0 _Bool a$r_buff1_thd0; [L709] 0 int __unbuffered_cnt = 0; [L731] 0 int *a$read_delayed_var; [L713] 0 int __unbuffered_p0_EBX = 0; [L737] 0 _Bool main$tmp_guard1; [L736] 0 _Bool main$tmp_guard0; [L733] 0 _Bool a$w_buff0_used; [L723] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff0_thd2; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L848] 0 pthread_t t633; [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t633, ((void *)0), P0, ((void *)0))=0, t633={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 [L764] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L850] 0 pthread_t t634; [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t634, ((void *)0), P1, ((void *)0))=1, t633={3:0}, t634={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L852] 0 pthread_t t635; [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t635, ((void *)0), P2, ((void *)0))=2, t633={3:0}, t634={7:0}, t635={15:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L767] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L787] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L804] 3 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L807] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=2] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633={3:0}, t634={7:0}, t635={15:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=2] [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L868] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=2] - 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: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 851]: 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: 849]: 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 7 procedures, 162 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 14.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 101 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 606 IncrementalHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 37 mSDtfsCounter, 606 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1492occurred in iteration=0, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 147 SizeOfPredicates, 12 NumberOfNonLiveVariables, 619 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-18 18:49:23,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e32948b-8f44-4362-9f20-293892f62d77/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample