./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 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_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a --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 ebf6aadb7b83b59f90765b7cb8b0362853c5f80603629c3d563bbb938a6df3b1 --- 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-b5237d8 [2022-11-21 13:58:01,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:58:01,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:58:01,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:58:01,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:58:01,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:58:01,935 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:58:01,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:58:01,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:58:01,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:58:01,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:58:01,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:58:01,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:58:01,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:58:01,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:58:01,959 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:58:01,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:58:01,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:58:01,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:58:01,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:58:01,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:58:01,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:58:01,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:58:01,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:58:01,988 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:58:01,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:58:01,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:58:01,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:58:01,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:58:01,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:58:01,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:58:01,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:58:01,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:58:01,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:58:01,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:58:01,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:58:02,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:58:02,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:58:02,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:58:02,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:58:02,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:58:02,003 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 13:58:02,045 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:58:02,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:58:02,045 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:58:02,045 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:58:02,046 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:58:02,046 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:58:02,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:58:02,050 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:58:02,050 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:58:02,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:58:02,052 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:58:02,052 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:58:02,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:58:02,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:58:02,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:58:02,053 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 13:58:02,053 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 13:58:02,053 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 13:58:02,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:58:02,053 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 13:58:02,054 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:58:02,054 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:58:02,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:58:02,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:58:02,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:58:02,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:58:02,055 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:58:02,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:58:02,056 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:58:02,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:58:02,056 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_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a 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 -> ebf6aadb7b83b59f90765b7cb8b0362853c5f80603629c3d563bbb938a6df3b1 [2022-11-21 13:58:02,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:58:02,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:58:02,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:58:02,456 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:58:02,456 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:58:02,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-11-21 13:58:05,597 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:58:05,894 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:58:05,895 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-11-21 13:58:05,910 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/data/aa4129592/4babc2c0259c4830b194e9000819ac11/FLAG16da86e76 [2022-11-21 13:58:05,927 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/data/aa4129592/4babc2c0259c4830b194e9000819ac11 [2022-11-21 13:58:05,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:58:05,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:58:05,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:58:05,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:58:05,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:58:05,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:58:05" (1/1) ... [2022-11-21 13:58:05,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5773c004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:05, skipping insertion in model container [2022-11-21 13:58:05,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:58:05" (1/1) ... [2022-11-21 13:58:05,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:58:06,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:58:06,191 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2022-11-21 13:58:06,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:58:06,412 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:58:06,437 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2022-11-21 13:58:06,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:58:06,594 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:58:06,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:06 WrapperNode [2022-11-21 13:58:06,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:58:06,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:58:06,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:58:06,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:58:06,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:06" (1/1) ... [2022-11-21 13:58:06,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:06" (1/1) ... [2022-11-21 13:58:06,681 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-11-21 13:58:06,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:58:06,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:58:06,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:58:06,682 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:58:06,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:06" (1/1) ... [2022-11-21 13:58:06,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:06" (1/1) ... [2022-11-21 13:58:06,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:06" (1/1) ... [2022-11-21 13:58:06,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:06" (1/1) ... [2022-11-21 13:58:06,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:06" (1/1) ... [2022-11-21 13:58:06,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:06" (1/1) ... [2022-11-21 13:58:06,718 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:06" (1/1) ... [2022-11-21 13:58:06,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:06" (1/1) ... [2022-11-21 13:58:06,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:58:06,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:58:06,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:58:06,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:58:06,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:06" (1/1) ... [2022-11-21 13:58:06,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:58:06,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:06,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:58:06,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:58:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 13:58:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 13:58:06,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:58:06,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 13:58:06,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:58:06,825 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 13:58:06,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 13:58:06,826 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 13:58:06,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 13:58:06,827 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 13:58:06,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 13:58:06,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 13:58:06,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 13:58:06,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:58:06,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:58:06,830 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 13:58:07,012 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:58:07,014 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:58:07,545 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:58:07,730 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:58:07,731 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 13:58:07,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:58:07 BoogieIcfgContainer [2022-11-21 13:58:07,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:58:07,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:58:07,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:58:07,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:58:07,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:58:05" (1/3) ... [2022-11-21 13:58:07,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633a5351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:58:07, skipping insertion in model container [2022-11-21 13:58:07,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:06" (2/3) ... [2022-11-21 13:58:07,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@633a5351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:58:07, skipping insertion in model container [2022-11-21 13:58:07,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:58:07" (3/3) ... [2022-11-21 13:58:07,746 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-11-21 13:58:07,768 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:58:07,769 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-21 13:58:07,769 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 13:58:07,864 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 13:58:07,911 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 13:58:07,930 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 125 transitions, 265 flow [2022-11-21 13:58:07,935 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 125 transitions, 265 flow [2022-11-21 13:58:07,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-11-21 13:58:08,043 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-11-21 13:58:08,044 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 13:58:08,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-21 13:58:08,055 INFO L119 LiptonReduction]: Number of co-enabled transitions 2320 [2022-11-21 13:58:13,606 INFO L134 LiptonReduction]: Checked pairs total: 6372 [2022-11-21 13:58:13,607 INFO L136 LiptonReduction]: Total number of compositions: 124 [2022-11-21 13:58:13,615 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-21 13:58:13,747 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:13,773 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:58:13,780 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;@44dd0fb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:58:13,780 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-21 13:58:13,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 13:58:13,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:13,793 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 13:58:13,794 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 13:58:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:13,799 INFO L85 PathProgramCache]: Analyzing trace with hash 541, now seen corresponding path program 1 times [2022-11-21 13:58:13,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:13,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271558676] [2022-11-21 13:58:13,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:13,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:13,937 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-21 13:58:13,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:13,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271558676] [2022-11-21 13:58:13,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271558676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:13,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:13,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 13:58:13,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459077213] [2022-11-21 13:58:13,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:13,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 13:58:13,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:13,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 13:58:13,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:58:13,983 INFO L87 Difference]: Start difference. First operand has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 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-21 13:58:14,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:14,117 INFO L93 Difference]: Finished difference Result 1024 states and 3277 transitions. [2022-11-21 13:58:14,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 13:58:14,120 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-21 13:58:14,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:14,150 INFO L225 Difference]: With dead ends: 1024 [2022-11-21 13:58:14,150 INFO L226 Difference]: Without dead ends: 1024 [2022-11-21 13:58:14,151 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-21 13:58:14,154 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:14,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:58:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2022-11-21 13:58:14,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2022-11-21 13:58:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1019 states have (on average 3.215897939156035) internal successors, (3277), 1023 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:14,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 3277 transitions. [2022-11-21 13:58:14,259 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 3277 transitions. Word has length 1 [2022-11-21 13:58:14,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:14,259 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 3277 transitions. [2022-11-21 13:58:14,259 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-21 13:58:14,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 3277 transitions. [2022-11-21 13:58:14,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 13:58:14,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:14,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 13:58:14,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 13:58:14,260 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-21 13:58:14,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:14,261 INFO L85 PathProgramCache]: Analyzing trace with hash 531278, now seen corresponding path program 1 times [2022-11-21 13:58:14,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:14,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52560724] [2022-11-21 13:58:14,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:14,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:14,571 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-21 13:58:14,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:14,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52560724] [2022-11-21 13:58:14,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52560724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:14,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:14,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 13:58:14,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616355800] [2022-11-21 13:58:14,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:14,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:58:14,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:14,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:58:14,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:58:14,575 INFO L87 Difference]: Start difference. First operand 1024 states and 3277 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-21 13:58:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:14,674 INFO L93 Difference]: Finished difference Result 837 states and 2640 transitions. [2022-11-21 13:58:14,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:58:14,675 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-21 13:58:14,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:14,681 INFO L225 Difference]: With dead ends: 837 [2022-11-21 13:58:14,681 INFO L226 Difference]: Without dead ends: 812 [2022-11-21 13:58:14,683 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-21 13:58:14,689 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:14,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:58:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-21 13:58:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2022-11-21 13:58:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 3.1790123456790123) internal successors, (2575), 811 states have internal predecessors, (2575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2022-11-21 13:58:14,732 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 3 [2022-11-21 13:58:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:14,733 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2022-11-21 13:58:14,733 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-21 13:58:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2022-11-21 13:58:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 13:58:14,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:14,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:14,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 13:58:14,737 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-21 13:58:14,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:14,737 INFO L85 PathProgramCache]: Analyzing trace with hash -584539973, now seen corresponding path program 1 times [2022-11-21 13:58:14,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:14,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092843272] [2022-11-21 13:58:14,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:14,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:15,134 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-21 13:58:15,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:15,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092843272] [2022-11-21 13:58:15,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092843272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:15,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:15,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 13:58:15,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206287984] [2022-11-21 13:58:15,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:15,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:58:15,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:15,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:58:15,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:58:15,137 INFO L87 Difference]: Start difference. First operand 812 states and 2575 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-21 13:58:15,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:15,224 INFO L93 Difference]: Finished difference Result 802 states and 2537 transitions. [2022-11-21 13:58:15,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:58:15,225 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-21 13:58:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:15,232 INFO L225 Difference]: With dead ends: 802 [2022-11-21 13:58:15,232 INFO L226 Difference]: Without dead ends: 802 [2022-11-21 13:58:15,233 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-21 13:58:15,236 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:15,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:58:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-11-21 13:58:15,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2022-11-21 13:58:15,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 800 states have (on average 3.17125) internal successors, (2537), 801 states have internal predecessors, (2537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 2537 transitions. [2022-11-21 13:58:15,270 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 2537 transitions. Word has length 9 [2022-11-21 13:58:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:15,271 INFO L495 AbstractCegarLoop]: Abstraction has 802 states and 2537 transitions. [2022-11-21 13:58:15,272 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-21 13:58:15,272 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 2537 transitions. [2022-11-21 13:58:15,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 13:58:15,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:15,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:15,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 13:58:15,275 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-21 13:58:15,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:15,277 INFO L85 PathProgramCache]: Analyzing trace with hash -942464807, now seen corresponding path program 1 times [2022-11-21 13:58:15,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:15,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11587] [2022-11-21 13:58:15,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:15,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:15,529 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-21 13:58:15,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:15,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11587] [2022-11-21 13:58:15,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:15,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:15,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:58:15,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528710835] [2022-11-21 13:58:15,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:15,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:58:15,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:15,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:58:15,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:58:15,538 INFO L87 Difference]: Start difference. First operand 802 states and 2537 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:15,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:15,694 INFO L93 Difference]: Finished difference Result 615 states and 1653 transitions. [2022-11-21 13:58:15,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:58:15,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 13:58:15,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:15,697 INFO L225 Difference]: With dead ends: 615 [2022-11-21 13:58:15,697 INFO L226 Difference]: Without dead ends: 490 [2022-11-21 13:58:15,698 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-21 13:58:15,700 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 33 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:15,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 10 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:58:15,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-11-21 13:58:15,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2022-11-21 13:58:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 488 states have (on average 2.6413934426229506) internal successors, (1289), 489 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1289 transitions. [2022-11-21 13:58:15,718 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1289 transitions. Word has length 10 [2022-11-21 13:58:15,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:15,718 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 1289 transitions. [2022-11-21 13:58:15,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:15,719 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1289 transitions. [2022-11-21 13:58:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 13:58:15,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:15,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:15,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 13:58:15,723 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-21 13:58:15,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:15,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1219259576, now seen corresponding path program 1 times [2022-11-21 13:58:15,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:15,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487745088] [2022-11-21 13:58:15,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:15,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:15,962 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-21 13:58:15,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:15,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487745088] [2022-11-21 13:58:15,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487745088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:15,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:15,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:58:15,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346283491] [2022-11-21 13:58:15,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:15,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:58:15,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:15,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:58:15,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:58:15,970 INFO L87 Difference]: Start difference. First operand 490 states and 1289 transitions. Second operand has 3 states, 2 states have (on average 6.5) 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-21 13:58:16,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:16,048 INFO L93 Difference]: Finished difference Result 781 states and 2002 transitions. [2022-11-21 13:58:16,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:58:16,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) 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-21 13:58:16,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:16,054 INFO L225 Difference]: With dead ends: 781 [2022-11-21 13:58:16,055 INFO L226 Difference]: Without dead ends: 781 [2022-11-21 13:58:16,055 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-21 13:58:16,056 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:16,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:58:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2022-11-21 13:58:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 663. [2022-11-21 13:58:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 661 states have (on average 2.6596066565809378) internal successors, (1758), 662 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1758 transitions. [2022-11-21 13:58:16,079 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1758 transitions. Word has length 13 [2022-11-21 13:58:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:16,080 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 1758 transitions. [2022-11-21 13:58:16,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) 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-21 13:58:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1758 transitions. [2022-11-21 13:58:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 13:58:16,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:16,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:16,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 13:58:16,083 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-21 13:58:16,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash 438559342, now seen corresponding path program 1 times [2022-11-21 13:58:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:16,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569152855] [2022-11-21 13:58:16,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:16,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:58:16,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:16,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569152855] [2022-11-21 13:58:16,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569152855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:16,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:16,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:58:16,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930337586] [2022-11-21 13:58:16,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:16,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:58:16,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:16,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:58:16,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:58:16,407 INFO L87 Difference]: Start difference. First operand 663 states and 1758 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-21 13:58:16,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:16,605 INFO L93 Difference]: Finished difference Result 469 states and 1096 transitions. [2022-11-21 13:58:16,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:58:16,606 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-21 13:58:16,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:16,608 INFO L225 Difference]: With dead ends: 469 [2022-11-21 13:58:16,608 INFO L226 Difference]: Without dead ends: 367 [2022-11-21 13:58:16,608 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-21 13:58:16,609 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 52 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:16,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 14 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:58:16,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-11-21 13:58:16,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 355. [2022-11-21 13:58:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 353 states have (on average 2.2889518413597734) internal successors, (808), 354 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 808 transitions. [2022-11-21 13:58:16,620 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 808 transitions. Word has length 13 [2022-11-21 13:58:16,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:16,620 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 808 transitions. [2022-11-21 13:58:16,620 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-21 13:58:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 808 transitions. [2022-11-21 13:58:16,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 13:58:16,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:16,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:16,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 13:58:16,622 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-21 13:58:16,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:16,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1918575254, now seen corresponding path program 1 times [2022-11-21 13:58:16,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:16,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375864454] [2022-11-21 13:58:16,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:16,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:16,811 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-21 13:58:16,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:16,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375864454] [2022-11-21 13:58:16,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375864454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:16,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:16,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:58:16,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927917841] [2022-11-21 13:58:16,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:16,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:58:16,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:16,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:58:16,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:58:16,814 INFO L87 Difference]: Start difference. First operand 355 states and 808 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:16,908 INFO L93 Difference]: Finished difference Result 481 states and 1075 transitions. [2022-11-21 13:58:16,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:58:16,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 13:58:16,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:16,911 INFO L225 Difference]: With dead ends: 481 [2022-11-21 13:58:16,911 INFO L226 Difference]: Without dead ends: 481 [2022-11-21 13:58:16,911 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-21 13:58:16,912 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:16,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:58:16,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-11-21 13:58:16,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 355. [2022-11-21 13:58:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 353 states have (on average 2.3002832861189804) internal successors, (812), 354 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 812 transitions. [2022-11-21 13:58:16,924 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 812 transitions. Word has length 17 [2022-11-21 13:58:16,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:16,924 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 812 transitions. [2022-11-21 13:58:16,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:16,924 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 812 transitions. [2022-11-21 13:58:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 13:58:16,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:16,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:16,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 13:58:16,926 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-21 13:58:16,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:16,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1970283819, now seen corresponding path program 1 times [2022-11-21 13:58:16,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:16,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26084141] [2022-11-21 13:58:16,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:16,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:17,175 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-21 13:58:17,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:17,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26084141] [2022-11-21 13:58:17,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26084141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:17,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:17,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:58:17,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074888817] [2022-11-21 13:58:17,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:17,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:58:17,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:17,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:58:17,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:58:17,178 INFO L87 Difference]: Start difference. First operand 355 states and 812 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:17,337 INFO L93 Difference]: Finished difference Result 301 states and 691 transitions. [2022-11-21 13:58:17,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:58:17,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 13:58:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:17,339 INFO L225 Difference]: With dead ends: 301 [2022-11-21 13:58:17,339 INFO L226 Difference]: Without dead ends: 278 [2022-11-21 13:58:17,339 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-21 13:58:17,340 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 73 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:17,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 14 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:58:17,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-11-21 13:58:17,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2022-11-21 13:58:17,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 276 states have (on average 2.351449275362319) internal successors, (649), 277 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 649 transitions. [2022-11-21 13:58:17,349 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 649 transitions. Word has length 17 [2022-11-21 13:58:17,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:17,349 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 649 transitions. [2022-11-21 13:58:17,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 649 transitions. [2022-11-21 13:58:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 13:58:17,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:17,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:17,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 13:58:17,351 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-21 13:58:17,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:17,352 INFO L85 PathProgramCache]: Analyzing trace with hash 235380293, now seen corresponding path program 1 times [2022-11-21 13:58:17,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:17,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278382376] [2022-11-21 13:58:17,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:17,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:17,576 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-21 13:58:17,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:17,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278382376] [2022-11-21 13:58:17,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278382376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:17,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:17,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:58:17,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068257865] [2022-11-21 13:58:17,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:17,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:58:17,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:17,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:58:17,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:58:17,579 INFO L87 Difference]: Start difference. First operand 278 states and 649 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:17,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:17,687 INFO L93 Difference]: Finished difference Result 380 states and 864 transitions. [2022-11-21 13:58:17,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:58:17,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-21 13:58:17,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:17,689 INFO L225 Difference]: With dead ends: 380 [2022-11-21 13:58:17,689 INFO L226 Difference]: Without dead ends: 380 [2022-11-21 13:58:17,690 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-21 13:58:17,690 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 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-21 13:58:17,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 7 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:58:17,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-21 13:58:17,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 266. [2022-11-21 13:58:17,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 264 states have (on average 2.3484848484848486) internal successors, (620), 265 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 620 transitions. [2022-11-21 13:58:17,700 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 620 transitions. Word has length 21 [2022-11-21 13:58:17,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:17,701 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 620 transitions. [2022-11-21 13:58:17,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 620 transitions. [2022-11-21 13:58:17,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 13:58:17,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:17,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:17,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 13:58:17,703 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-21 13:58:17,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:17,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1003076369, now seen corresponding path program 2 times [2022-11-21 13:58:17,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:17,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85058536] [2022-11-21 13:58:17,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:17,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:58:17,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:58:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:58:17,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:58:17,853 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 13:58:17,854 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-21 13:58:17,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-21 13:58:17,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-21 13:58:17,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-21 13:58:17,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-21 13:58:17,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-21 13:58:17,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-21 13:58:17,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-21 13:58:17,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-21 13:58:17,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-21 13:58:17,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-21 13:58:17,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-21 13:58:17,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-21 13:58:17,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 13:58:17,861 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:17,867 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 13:58:17,867 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 13:58:17,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:58:17 BasicIcfg [2022-11-21 13:58:17,927 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 13:58:17,928 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 13:58:17,928 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 13:58:17,928 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 13:58:17,928 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:58:07" (3/4) ... [2022-11-21 13:58:17,931 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 13:58:17,931 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 13:58:17,932 INFO L158 Benchmark]: Toolchain (without parser) took 12000.60ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 175.6MB in the beginning and 189.5MB in the end (delta: -13.9MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2022-11-21 13:58:17,932 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 146.8MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:58:17,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 662.94ms. Allocated memory is still 209.7MB. Free memory was 175.6MB in the beginning and 151.9MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-21 13:58:17,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.00ms. Allocated memory is still 209.7MB. Free memory was 151.9MB in the beginning and 149.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 13:58:17,933 INFO L158 Benchmark]: Boogie Preprocessor took 49.00ms. Allocated memory is still 209.7MB. Free memory was 149.8MB in the beginning and 147.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 13:58:17,933 INFO L158 Benchmark]: RCFGBuilder took 1001.66ms. Allocated memory is still 209.7MB. Free memory was 147.7MB in the beginning and 112.1MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-21 13:58:17,934 INFO L158 Benchmark]: TraceAbstraction took 10189.99ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 111.4MB in the beginning and 189.5MB in the end (delta: -78.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:58:17,934 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 251.7MB. Free memory is still 189.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:58:17,935 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 146.8MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 662.94ms. Allocated memory is still 209.7MB. Free memory was 175.6MB in the beginning and 151.9MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.00ms. Allocated memory is still 209.7MB. Free memory was 151.9MB in the beginning and 149.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.00ms. Allocated memory is still 209.7MB. Free memory was 149.8MB in the beginning and 147.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1001.66ms. Allocated memory is still 209.7MB. Free memory was 147.7MB in the beginning and 112.1MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10189.99ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 111.4MB in the beginning and 189.5MB in the end (delta: -78.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 251.7MB. Free memory is still 189.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 133 PlacesBefore, 44 PlacesAfterwards, 125 TransitionsBefore, 35 TransitionsAfterwards, 2320 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 124 TotalNumberOfCompositions, 6372 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3157, independent: 2977, independent conditional: 0, independent unconditional: 2977, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1654, independent: 1601, independent conditional: 0, independent unconditional: 1601, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1654, independent: 1574, independent conditional: 0, independent unconditional: 1574, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 80, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 493, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 435, dependent conditional: 0, dependent unconditional: 435, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3157, independent: 1376, independent conditional: 0, independent unconditional: 1376, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 1654, unknown conditional: 0, unknown unconditional: 1654] , Statistics on independence cache: Total cache size (in pairs): 193, Positive cache size: 173, Positive conditional cache size: 0, Positive unconditional cache size: 173, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1385; [L834] FCALL, FORK 0 pthread_create(&t1385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1385, ((void *)0), P0, ((void *)0))=-2, t1385={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t1386; [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L836] FCALL, FORK 0 pthread_create(&t1386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1386, ((void *)0), P1, ((void *)0))=-1, t1385={5:0}, t1386={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t1387; [L838] FCALL, FORK 0 pthread_create(&t1387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1387, ((void *)0), P2, ((void *)0))=0, t1385={5:0}, t1386={6:0}, t1387={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L795] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 3 z$flush_delayed = weak$$choice2 [L798] 3 z$mem_tmp = z [L799] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L800] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L801] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L802] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L803] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L805] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 __unbuffered_p2_EAX = z [L807] 3 z = z$flush_delayed ? z$mem_tmp : z [L808] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L812] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L813] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L814] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L815] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L845] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L846] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L847] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L848] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1385={5:0}, t1386={6:0}, t1387={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L853] 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_p1_EAX=0, __unbuffered_p2_EAX=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=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 838]: 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: 834]: 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, 152 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 226 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 226 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 578 IncrementalHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 28 mSDtfsCounter, 578 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1098occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 370 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-21 13:58:17,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a --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 ebf6aadb7b83b59f90765b7cb8b0362853c5f80603629c3d563bbb938a6df3b1 --- 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-b5237d8 [2022-11-21 13:58:20,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:58:20,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:58:20,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:58:20,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:58:20,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:58:20,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:58:20,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:58:20,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:58:20,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:58:20,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:58:20,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:58:20,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:58:20,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:58:20,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:58:20,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:58:20,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:58:20,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:58:20,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:58:20,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:58:20,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:58:20,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:58:20,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:58:20,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:58:20,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:58:20,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:58:20,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:58:20,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:58:20,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:58:20,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:58:20,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:58:20,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:58:20,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:58:20,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:58:20,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:58:20,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:58:20,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:58:20,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:58:20,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:58:20,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:58:20,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:58:20,546 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-21 13:58:20,594 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:58:20,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:58:20,596 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:58:20,597 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:58:20,598 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:58:20,598 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:58:20,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:58:20,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:58:20,599 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:58:20,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:58:20,600 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:58:20,601 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:58:20,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:58:20,601 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:58:20,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:58:20,602 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 13:58:20,602 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 13:58:20,602 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 13:58:20,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:58:20,602 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 13:58:20,603 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-21 13:58:20,603 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-21 13:58:20,603 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:58:20,603 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:58:20,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:58:20,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:58:20,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:58:20,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:58:20,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:58:20,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:58:20,605 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-21 13:58:20,605 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-21 13:58:20,605 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-21 13:58:20,605 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_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a 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 -> ebf6aadb7b83b59f90765b7cb8b0362853c5f80603629c3d563bbb938a6df3b1 [2022-11-21 13:58:21,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:58:21,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:58:21,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:58:21,040 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:58:21,041 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:58:21,042 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-11-21 13:58:24,090 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:58:24,509 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:58:24,509 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-11-21 13:58:24,533 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/data/94ccb44c1/cc100a5035fe4ef4bd544a3db41d3b84/FLAG84e098163 [2022-11-21 13:58:24,552 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/data/94ccb44c1/cc100a5035fe4ef4bd544a3db41d3b84 [2022-11-21 13:58:24,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:58:24,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:58:24,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:58:24,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:58:24,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:58:24,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:58:24" (1/1) ... [2022-11-21 13:58:24,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cdf84d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:24, skipping insertion in model container [2022-11-21 13:58:24,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:58:24" (1/1) ... [2022-11-21 13:58:24,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:58:24,647 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:58:24,817 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2022-11-21 13:58:25,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:58:25,157 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:58:25,176 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/sv-benchmarks/c/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2022-11-21 13:58:25,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:58:25,286 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:58:25,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:25 WrapperNode [2022-11-21 13:58:25,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:58:25,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:58:25,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:58:25,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:58:25,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:25" (1/1) ... [2022-11-21 13:58:25,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:25" (1/1) ... [2022-11-21 13:58:25,340 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-11-21 13:58:25,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:58:25,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:58:25,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:58:25,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:58:25,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:25" (1/1) ... [2022-11-21 13:58:25,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:25" (1/1) ... [2022-11-21 13:58:25,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:25" (1/1) ... [2022-11-21 13:58:25,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:25" (1/1) ... [2022-11-21 13:58:25,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:25" (1/1) ... [2022-11-21 13:58:25,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:25" (1/1) ... [2022-11-21 13:58:25,403 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:25" (1/1) ... [2022-11-21 13:58:25,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:25" (1/1) ... [2022-11-21 13:58:25,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:58:25,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:58:25,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:58:25,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:58:25,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:25" (1/1) ... [2022-11-21 13:58:25,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:58:25,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:25,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:58:25,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:58:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 13:58:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:58:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 13:58:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:58:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-21 13:58:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-21 13:58:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 13:58:25,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 13:58:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 13:58:25,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 13:58:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 13:58:25,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 13:58:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 13:58:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:58:25,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:58:25,529 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 13:58:25,796 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:58:25,798 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:58:26,246 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:58:26,450 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:58:26,451 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 13:58:26,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:58:26 BoogieIcfgContainer [2022-11-21 13:58:26,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:58:26,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:58:26,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:58:26,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:58:26,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:58:24" (1/3) ... [2022-11-21 13:58:26,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fe88dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:58:26, skipping insertion in model container [2022-11-21 13:58:26,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:25" (2/3) ... [2022-11-21 13:58:26,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fe88dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:58:26, skipping insertion in model container [2022-11-21 13:58:26,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:58:26" (3/3) ... [2022-11-21 13:58:26,463 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-11-21 13:58:26,483 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:58:26,484 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-21 13:58:26,484 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 13:58:26,572 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 13:58:26,605 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 13:58:26,627 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 126 transitions, 267 flow [2022-11-21 13:58:26,636 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 126 transitions, 267 flow [2022-11-21 13:58:26,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 267 flow [2022-11-21 13:58:26,728 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-11-21 13:58:26,728 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 13:58:26,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-21 13:58:26,745 INFO L119 LiptonReduction]: Number of co-enabled transitions 2320 [2022-11-21 13:58:36,315 INFO L134 LiptonReduction]: Checked pairs total: 6325 [2022-11-21 13:58:36,316 INFO L136 LiptonReduction]: Total number of compositions: 125 [2022-11-21 13:58:36,330 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-21 13:58:36,436 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:36,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:58:36,462 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;@3fb29595, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:58:36,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-21 13:58:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:36,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 13:58:36,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:36,473 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 13:58:36,473 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-21 13:58:36,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:36,479 INFO L85 PathProgramCache]: Analyzing trace with hash 544, now seen corresponding path program 1 times [2022-11-21 13:58:36,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:58:36,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133765324] [2022-11-21 13:58:36,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:36,491 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-21 13:58:36,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:58:36,499 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:36,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:36,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-21 13:58:36,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:36,632 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-21 13:58:36,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:58:36,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:58:36,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133765324] [2022-11-21 13:58:36,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133765324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:36,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:36,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 13:58:36,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695043648] [2022-11-21 13:58:36,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:36,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 13:58:36,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:58:36,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 13:58:36,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:58:36,670 INFO L87 Difference]: Start difference. First operand has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 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-21 13:58:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:36,893 INFO L93 Difference]: Finished difference Result 1024 states and 3277 transitions. [2022-11-21 13:58:36,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 13:58:36,895 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-21 13:58:36,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:36,929 INFO L225 Difference]: With dead ends: 1024 [2022-11-21 13:58:36,930 INFO L226 Difference]: Without dead ends: 1024 [2022-11-21 13:58:36,931 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-21 13:58:36,934 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:36,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:58:36,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2022-11-21 13:58:37,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2022-11-21 13:58:37,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1019 states have (on average 3.215897939156035) internal successors, (3277), 1023 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:37,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 3277 transitions. [2022-11-21 13:58:37,120 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 3277 transitions. Word has length 1 [2022-11-21 13:58:37,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:37,121 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 3277 transitions. [2022-11-21 13:58:37,124 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-21 13:58:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 3277 transitions. [2022-11-21 13:58:37,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 13:58:37,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:37,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 13:58:37,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-21 13:58:37,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:37,338 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-21 13:58:37,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:37,338 INFO L85 PathProgramCache]: Analyzing trace with hash 534281, now seen corresponding path program 1 times [2022-11-21 13:58:37,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:58:37,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018228367] [2022-11-21 13:58:37,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:37,340 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-21 13:58:37,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:58:37,342 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:37,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:37,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 13:58:37,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:37,468 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-21 13:58:37,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:58:37,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:58:37,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018228367] [2022-11-21 13:58:37,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018228367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:37,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:37,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 13:58:37,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798295740] [2022-11-21 13:58:37,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:37,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:58:37,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:58:37,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:58:37,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:58:37,484 INFO L87 Difference]: Start difference. First operand 1024 states and 3277 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-21 13:58:37,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:37,654 INFO L93 Difference]: Finished difference Result 837 states and 2640 transitions. [2022-11-21 13:58:37,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:58:37,659 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-21 13:58:37,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:37,671 INFO L225 Difference]: With dead ends: 837 [2022-11-21 13:58:37,677 INFO L226 Difference]: Without dead ends: 812 [2022-11-21 13:58:37,677 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-21 13:58:37,679 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:37,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:58:37,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-21 13:58:37,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2022-11-21 13:58:37,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 3.1790123456790123) internal successors, (2575), 811 states have internal predecessors, (2575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2022-11-21 13:58:37,765 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 3 [2022-11-21 13:58:37,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:37,766 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2022-11-21 13:58:37,766 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-21 13:58:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2022-11-21 13:58:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 13:58:37,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:37,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:37,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:37,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:37,980 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-21 13:58:37,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:37,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1748838777, now seen corresponding path program 1 times [2022-11-21 13:58:37,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:58:37,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677219495] [2022-11-21 13:58:37,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:37,982 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-21 13:58:37,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:58:37,983 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:37,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:38,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 13:58:38,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:38,177 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-21 13:58:38,179 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:58:38,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:58:38,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677219495] [2022-11-21 13:58:38,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677219495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:38,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:38,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:58:38,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076280014] [2022-11-21 13:58:38,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:38,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:58:38,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:58:38,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:58:38,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:58:38,183 INFO L87 Difference]: Start difference. First operand 812 states and 2575 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-21 13:58:38,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:38,391 INFO L93 Difference]: Finished difference Result 617 states and 1659 transitions. [2022-11-21 13:58:38,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:58:38,392 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-21 13:58:38,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:38,396 INFO L225 Difference]: With dead ends: 617 [2022-11-21 13:58:38,397 INFO L226 Difference]: Without dead ends: 492 [2022-11-21 13:58:38,398 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-21 13:58:38,401 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:38,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 10 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:58:38,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-11-21 13:58:38,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2022-11-21 13:58:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 490 states have (on average 2.642857142857143) internal successors, (1295), 491 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1295 transitions. [2022-11-21 13:58:38,426 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1295 transitions. Word has length 9 [2022-11-21 13:58:38,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:38,426 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 1295 transitions. [2022-11-21 13:58:38,426 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-21 13:58:38,427 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1295 transitions. [2022-11-21 13:58:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 13:58:38,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:38,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:38,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:38,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:38,643 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-21 13:58:38,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:38,644 INFO L85 PathProgramCache]: Analyzing trace with hash 310082785, now seen corresponding path program 1 times [2022-11-21 13:58:38,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:58:38,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754278080] [2022-11-21 13:58:38,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:38,647 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-21 13:58:38,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:58:38,649 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:38,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:38,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 13:58:38,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:38,828 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-21 13:58:38,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:58:38,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:58:38,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754278080] [2022-11-21 13:58:38,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754278080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:38,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:38,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:58:38,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537411615] [2022-11-21 13:58:38,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:38,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:58:38,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:58:38,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:58:38,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:58:38,833 INFO L87 Difference]: Start difference. First operand 492 states and 1295 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-21 13:58:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:39,123 INFO L93 Difference]: Finished difference Result 313 states and 731 transitions. [2022-11-21 13:58:39,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:58:39,124 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-21 13:58:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:39,126 INFO L225 Difference]: With dead ends: 313 [2022-11-21 13:58:39,126 INFO L226 Difference]: Without dead ends: 252 [2022-11-21 13:58:39,126 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-21 13:58:39,127 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 44 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:39,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 18 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:58:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-21 13:58:39,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2022-11-21 13:58:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 250 states have (on average 2.3) internal successors, (575), 251 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-21 13:58:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 575 transitions. [2022-11-21 13:58:39,144 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 575 transitions. Word has length 13 [2022-11-21 13:58:39,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:39,145 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 575 transitions. [2022-11-21 13:58:39,149 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-21 13:58:39,149 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 575 transitions. [2022-11-21 13:58:39,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 13:58:39,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:39,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:39,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:39,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:39,367 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-21 13:58:39,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:39,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1359310671, now seen corresponding path program 1 times [2022-11-21 13:58:39,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:58:39,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268290135] [2022-11-21 13:58:39,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:39,370 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-21 13:58:39,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:58:39,372 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:39,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:39,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:58:39,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:39,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:58:39,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:58:39,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:58:39,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268290135] [2022-11-21 13:58:39,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268290135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:39,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:39,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:58:39,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751006183] [2022-11-21 13:58:39,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:39,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:58:39,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:58:39,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:58:39,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:58:39,615 INFO L87 Difference]: Start difference. First operand 252 states and 575 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:39,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:39,937 INFO L93 Difference]: Finished difference Result 205 states and 479 transitions. [2022-11-21 13:58:39,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:58:39,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 13:58:39,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:39,939 INFO L225 Difference]: With dead ends: 205 [2022-11-21 13:58:39,939 INFO L226 Difference]: Without dead ends: 192 [2022-11-21 13:58:39,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:58:39,940 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 40 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:39,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 30 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:58:39,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-21 13:58:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-11-21 13:58:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 2.3947368421052633) internal successors, (455), 191 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 455 transitions. [2022-11-21 13:58:39,951 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 455 transitions. Word has length 17 [2022-11-21 13:58:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:39,952 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 455 transitions. [2022-11-21 13:58:39,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:39,952 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 455 transitions. [2022-11-21 13:58:39,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 13:58:39,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:39,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:39,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:40,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:40,169 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-21 13:58:40,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:40,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1894498955, now seen corresponding path program 1 times [2022-11-21 13:58:40,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:58:40,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495863036] [2022-11-21 13:58:40,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:40,170 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-21 13:58:40,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:58:40,172 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:40,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:40,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 13:58:40,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:58:40,342 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:58:40,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:58:40,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495863036] [2022-11-21 13:58:40,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495863036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:40,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:40,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:58:40,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813488664] [2022-11-21 13:58:40,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:40,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:58:40,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:58:40,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:58:40,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:58:40,345 INFO L87 Difference]: Start difference. First operand 192 states and 455 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:40,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:40,448 INFO L93 Difference]: Finished difference Result 280 states and 650 transitions. [2022-11-21 13:58:40,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:58:40,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-21 13:58:40,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:40,451 INFO L225 Difference]: With dead ends: 280 [2022-11-21 13:58:40,451 INFO L226 Difference]: Without dead ends: 280 [2022-11-21 13:58:40,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-21 13:58:40,452 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:40,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:58:40,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-21 13:58:40,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2022-11-21 13:58:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 276 states have (on average 2.351449275362319) internal successors, (649), 277 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 649 transitions. [2022-11-21 13:58:40,465 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 649 transitions. Word has length 21 [2022-11-21 13:58:40,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:40,465 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 649 transitions. [2022-11-21 13:58:40,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 649 transitions. [2022-11-21 13:58:40,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 13:58:40,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:40,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:40,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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)] Ended with exit code 0 [2022-11-21 13:58:40,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:40,687 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-21 13:58:40,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:40,688 INFO L85 PathProgramCache]: Analyzing trace with hash 131193973, now seen corresponding path program 2 times [2022-11-21 13:58:40,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:58:40,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167787710] [2022-11-21 13:58:40,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:58:40,688 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-21 13:58:40,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:58:40,690 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:40,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:40,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 13:58:40,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:58:40,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 13:58:40,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:40,888 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-21 13:58:40,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:58:40,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:58:40,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167787710] [2022-11-21 13:58:40,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167787710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:40,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:40,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:58:40,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722739904] [2022-11-21 13:58:40,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:40,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:58:40,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:58:40,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:58:40,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:58:40,891 INFO L87 Difference]: Start difference. First operand 278 states and 649 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:41,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:41,038 INFO L93 Difference]: Finished difference Result 380 states and 864 transitions. [2022-11-21 13:58:41,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:58:41,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-21 13:58:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:41,040 INFO L225 Difference]: With dead ends: 380 [2022-11-21 13:58:41,040 INFO L226 Difference]: Without dead ends: 380 [2022-11-21 13:58:41,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-21 13:58:41,041 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:41,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 7 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:58:41,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-21 13:58:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 266. [2022-11-21 13:58:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 264 states have (on average 2.3484848484848486) internal successors, (620), 265 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 620 transitions. [2022-11-21 13:58:41,052 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 620 transitions. Word has length 21 [2022-11-21 13:58:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:41,052 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 620 transitions. [2022-11-21 13:58:41,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:58:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 620 transitions. [2022-11-21 13:58:41,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 13:58:41,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:41,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:41,066 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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)] Ended with exit code 0 [2022-11-21 13:58:41,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:41,266 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-21 13:58:41,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:41,267 INFO L85 PathProgramCache]: Analyzing trace with hash -2029009525, now seen corresponding path program 3 times [2022-11-21 13:58:41,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:58:41,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779059881] [2022-11-21 13:58:41,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 13:58:41,268 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-21 13:58:41,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:58:41,271 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:41,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-21 13:58:41,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-21 13:58:41,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 13:58:41,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:58:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:58:41,606 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-21 13:58:41,614 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 13:58:41,615 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-21 13:58:41,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-21 13:58:41,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-21 13:58:41,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-21 13:58:41,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-21 13:58:41,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-21 13:58:41,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-21 13:58:41,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-21 13:58:41,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-21 13:58:41,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-21 13:58:41,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-21 13:58:41,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-21 13:58:41,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-21 13:58:41,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-21 13:58:41,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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-21 13:58:41,850 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-11-21 13:58:41,855 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 13:58:41,855 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 13:58:41,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:58:41 BasicIcfg [2022-11-21 13:58:41,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 13:58:41,925 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 13:58:41,926 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 13:58:41,926 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 13:58:41,926 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:58:26" (3/4) ... [2022-11-21 13:58:41,929 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 13:58:41,929 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 13:58:41,930 INFO L158 Benchmark]: Toolchain (without parser) took 17373.96ms. Allocated memory was 60.8MB in the beginning and 117.4MB in the end (delta: 56.6MB). Free memory was 37.5MB in the beginning and 38.5MB in the end (delta: -950.1kB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2022-11-21 13:58:41,930 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 60.8MB. Free memory was 38.2MB in the beginning and 38.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:58:41,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 729.64ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 37.4MB in the beginning and 45.9MB in the end (delta: -8.5MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2022-11-21 13:58:41,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.43ms. Allocated memory is still 79.7MB. Free memory was 45.9MB in the beginning and 43.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 13:58:41,931 INFO L158 Benchmark]: Boogie Preprocessor took 79.74ms. Allocated memory is still 79.7MB. Free memory was 43.3MB in the beginning and 41.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 13:58:41,932 INFO L158 Benchmark]: RCFGBuilder took 1032.30ms. Allocated memory is still 79.7MB. Free memory was 41.2MB in the beginning and 43.3MB in the end (delta: -2.1MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2022-11-21 13:58:41,932 INFO L158 Benchmark]: TraceAbstraction took 15469.35ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 42.5MB in the beginning and 38.5MB in the end (delta: 4.1MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2022-11-21 13:58:41,932 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 117.4MB. Free memory is still 38.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:58:41,934 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 60.8MB. Free memory was 38.2MB in the beginning and 38.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 729.64ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 37.4MB in the beginning and 45.9MB in the end (delta: -8.5MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.43ms. Allocated memory is still 79.7MB. Free memory was 45.9MB in the beginning and 43.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.74ms. Allocated memory is still 79.7MB. Free memory was 43.3MB in the beginning and 41.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1032.30ms. Allocated memory is still 79.7MB. Free memory was 41.2MB in the beginning and 43.3MB in the end (delta: -2.1MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15469.35ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 42.5MB in the beginning and 38.5MB in the end (delta: 4.1MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 117.4MB. Free memory is still 38.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.7s, 134 PlacesBefore, 44 PlacesAfterwards, 126 TransitionsBefore, 35 TransitionsAfterwards, 2320 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 125 TotalNumberOfCompositions, 6325 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3203, independent: 3025, independent conditional: 0, independent unconditional: 3025, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1701, independent: 1650, independent conditional: 0, independent unconditional: 1650, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1701, independent: 1623, independent conditional: 0, independent unconditional: 1623, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 78, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 428, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 374, dependent conditional: 0, dependent unconditional: 374, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3203, independent: 1375, independent conditional: 0, independent unconditional: 1375, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 1701, unknown conditional: 0, unknown unconditional: 1701] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 170, Positive conditional cache size: 0, Positive unconditional cache size: 170, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1385; [L834] FCALL, FORK 0 pthread_create(&t1385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1385, ((void *)0), P0, ((void *)0))=-1, t1385={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t1386; [L836] FCALL, FORK 0 pthread_create(&t1386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1386, ((void *)0), P1, ((void *)0))=0, t1385={-6:0}, t1386={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t1387; [L838] FCALL, FORK 0 pthread_create(&t1387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1387, ((void *)0), P2, ((void *)0))=1, t1385={-6:0}, t1386={-10:0}, t1387={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L795] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 3 z$flush_delayed = weak$$choice2 [L798] 3 z$mem_tmp = z [L799] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L800] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L801] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L802] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L803] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L805] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 __unbuffered_p2_EAX = z [L807] 3 z = z$flush_delayed ? z$mem_tmp : z [L808] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L812] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L813] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L814] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L815] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L845] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L846] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L847] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L848] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1385={-6:0}, t1386={-10:0}, t1387={-2:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L853] 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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 838]: 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: 834]: 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, 153 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 652 IncrementalHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 29 mSDtfsCounter, 652 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1098occurred in iteration=0, InterpolantAutomatonStates: 30, 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, 7 MinimizatonAttempts, 116 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 186 SizeOfPredicates, 13 NumberOfNonLiveVariables, 767 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-21 13:58:41,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e61f65ed-23fd-41cf-aa96-5d208135d53b/bin/uautomizer-vX5HgA9Q3a/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