./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.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_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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_c269120d-cfc9-4882-837b-0a5c9f95faca/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 2135a1882b0d27098e68a161f8694a670a72069d61776627736073247b8e4e23 --- 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 16:57:53,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:57:53,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:57:53,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:57:53,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:57:53,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:57:53,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:57:53,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:57:53,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:57:53,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:57:53,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:57:53,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:57:53,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:57:53,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:57:53,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:57:53,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:57:53,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:57:53,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:57:53,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:57:53,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:57:53,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:57:53,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:57:53,156 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:57:53,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:57:53,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:57:53,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:57:53,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:57:53,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:57:53,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:57:53,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:57:53,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:57:53,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:57:53,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:57:53,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:57:53,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:57:53,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:57:53,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:57:53,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:57:53,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:57:53,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:57:53,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:57:53,190 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 16:57:53,225 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:57:53,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:57:53,231 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:57:53,231 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:57:53,232 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:57:53,232 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:57:53,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:57:53,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:57:53,233 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:57:53,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:57:53,235 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:57:53,235 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:57:53,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:57:53,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:57:53,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:57:53,236 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 16:57:53,236 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 16:57:53,236 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 16:57:53,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:57:53,237 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:57:53,237 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:57:53,237 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:57:53,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:57:53,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:57:53,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:57:53,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:57:53,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:57:53,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:57:53,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:57:53,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:57:53,240 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_c269120d-cfc9-4882-837b-0a5c9f95faca/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_c269120d-cfc9-4882-837b-0a5c9f95faca/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 -> 2135a1882b0d27098e68a161f8694a670a72069d61776627736073247b8e4e23 [2022-11-21 16:57:53,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:57:53,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:57:53,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:57:53,526 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:57:53,526 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:57:53,528 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i [2022-11-21 16:57:56,633 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:57:56,896 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:57:56,899 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i [2022-11-21 16:57:56,921 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/data/84b1bf94d/510132fac5b24ff5ac1eb77dbbc5f821/FLAG0c9d47821 [2022-11-21 16:57:56,935 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/data/84b1bf94d/510132fac5b24ff5ac1eb77dbbc5f821 [2022-11-21 16:57:56,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:57:56,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:57:56,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:57:56,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:57:56,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:57:56,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:57:56" (1/1) ... [2022-11-21 16:57:56,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ec89ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:56, skipping insertion in model container [2022-11-21 16:57:56,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:57:56" (1/1) ... [2022-11-21 16:57:56,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:57:56,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:57:57,210 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_c269120d-cfc9-4882-837b-0a5c9f95faca/sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i[956,969] [2022-11-21 16:57:57,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:57:57,491 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:57:57,504 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_c269120d-cfc9-4882-837b-0a5c9f95faca/sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i[956,969] [2022-11-21 16:57:57,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:57:57,593 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:57:57,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:57 WrapperNode [2022-11-21 16:57:57,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:57:57,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:57:57,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:57:57,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:57:57,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:57" (1/1) ... [2022-11-21 16:57:57,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:57" (1/1) ... [2022-11-21 16:57:57,648 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 148 [2022-11-21 16:57:57,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:57:57,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:57:57,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:57:57,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:57:57,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:57" (1/1) ... [2022-11-21 16:57:57,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:57" (1/1) ... [2022-11-21 16:57:57,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:57" (1/1) ... [2022-11-21 16:57:57,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:57" (1/1) ... [2022-11-21 16:57:57,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:57" (1/1) ... [2022-11-21 16:57:57,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:57" (1/1) ... [2022-11-21 16:57:57,679 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:57" (1/1) ... [2022-11-21 16:57:57,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:57" (1/1) ... [2022-11-21 16:57:57,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:57:57,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:57:57,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:57:57,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:57:57,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:57" (1/1) ... [2022-11-21 16:57:57,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:57:57,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:57:57,723 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:57:57,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:57:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:57:57,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:57:57,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:57:57,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:57:57,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:57:57,762 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 16:57:57,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 16:57:57,762 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 16:57:57,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 16:57:57,762 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 16:57:57,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 16:57:57,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:57:57,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:57:57,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:57:57,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:57:57,765 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 16:57:57,950 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:57:57,953 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:57:58,388 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:57:58,562 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:57:58,562 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:57:58,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:57:58 BoogieIcfgContainer [2022-11-21 16:57:58,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:57:58,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:57:58,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:57:58,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:57:58,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:57:56" (1/3) ... [2022-11-21 16:57:58,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d08d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:57:58, skipping insertion in model container [2022-11-21 16:57:58,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:57:57" (2/3) ... [2022-11-21 16:57:58,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d08d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:57:58, skipping insertion in model container [2022-11-21 16:57:58,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:57:58" (3/3) ... [2022-11-21 16:57:58,574 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_pso.opt_tso.opt.i [2022-11-21 16:57:58,594 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:57:58,594 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-21 16:57:58,594 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:57:58,649 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 16:57:58,692 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 16:57:58,706 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 126 transitions, 267 flow [2022-11-21 16:57:58,715 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 126 transitions, 267 flow [2022-11-21 16:57:58,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 267 flow [2022-11-21 16:57:58,791 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-11-21 16:57:58,791 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:57:58,797 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 78 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-11-21 16:57:58,799 INFO L119 LiptonReduction]: Number of co-enabled transitions 2124 [2022-11-21 16:58:04,683 INFO L134 LiptonReduction]: Checked pairs total: 5370 [2022-11-21 16:58:04,683 INFO L136 LiptonReduction]: Total number of compositions: 127 [2022-11-21 16:58:04,692 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 34 transitions, 83 flow [2022-11-21 16:58:04,764 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 788 states, 777 states have (on average 3.2741312741312742) internal successors, (2544), 787 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states 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 16:58:04,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:58:04,789 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;@62b0c908, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:58:04,789 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-21 16:58:04,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 788 states, 777 states have (on average 3.2741312741312742) internal successors, (2544), 787 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states 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 16:58:04,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 16:58:04,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:04,800 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 16:58:04,800 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:58:04,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:04,805 INFO L85 PathProgramCache]: Analyzing trace with hash 559, now seen corresponding path program 1 times [2022-11-21 16:58:04,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:58:04,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110713498] [2022-11-21 16:58:04,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:04,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:58:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:04,924 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 16:58:04,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:58:04,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110713498] [2022-11-21 16:58:04,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110713498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:04,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:04,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 16:58:04,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180212613] [2022-11-21 16:58:04,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:04,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:58:04,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:58:04,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:58:04,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:58:04,969 INFO L87 Difference]: Start difference. First operand has 788 states, 777 states have (on average 3.2741312741312742) internal successors, (2544), 787 states have internal predecessors, (2544), 0 states have call successors, (0), 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 16:58:05,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:05,077 INFO L93 Difference]: Finished difference Result 746 states and 2336 transitions. [2022-11-21 16:58:05,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:58:05,088 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 16:58:05,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:05,117 INFO L225 Difference]: With dead ends: 746 [2022-11-21 16:58:05,117 INFO L226 Difference]: Without dead ends: 746 [2022-11-21 16:58:05,118 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 16:58:05,122 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:05,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:58:05,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-11-21 16:58:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2022-11-21 16:58:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 741 states have (on average 3.1524966261808367) internal successors, (2336), 745 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states 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 16:58:05,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 2336 transitions. [2022-11-21 16:58:05,238 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 2336 transitions. Word has length 1 [2022-11-21 16:58:05,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:05,238 INFO L495 AbstractCegarLoop]: Abstraction has 746 states and 2336 transitions. [2022-11-21 16:58:05,238 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 16:58:05,239 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 2336 transitions. [2022-11-21 16:58:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-21 16:58:05,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:05,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:58:05,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:58:05,240 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:58:05,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:05,242 INFO L85 PathProgramCache]: Analyzing trace with hash -485344934, now seen corresponding path program 1 times [2022-11-21 16:58:05,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:58:05,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793706927] [2022-11-21 16:58:05,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:05,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:58:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:05,675 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 16:58:05,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:58:05,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793706927] [2022-11-21 16:58:05,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793706927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:05,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:05,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:58:05,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276258507] [2022-11-21 16:58:05,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:05,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:58:05,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:58:05,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:58:05,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:58:05,679 INFO L87 Difference]: Start difference. First operand 746 states and 2336 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:05,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:05,759 INFO L93 Difference]: Finished difference Result 634 states and 1960 transitions. [2022-11-21 16:58:05,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:58:05,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-21 16:58:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:05,767 INFO L225 Difference]: With dead ends: 634 [2022-11-21 16:58:05,767 INFO L226 Difference]: Without dead ends: 618 [2022-11-21 16:58:05,768 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 16:58:05,776 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:05,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:58:05,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-11-21 16:58:05,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2022-11-21 16:58:05,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 616 states have (on average 3.116883116883117) internal successors, (1920), 617 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states 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 16:58:05,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1920 transitions. [2022-11-21 16:58:05,815 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 1920 transitions. Word has length 7 [2022-11-21 16:58:05,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:05,816 INFO L495 AbstractCegarLoop]: Abstraction has 618 states and 1920 transitions. [2022-11-21 16:58:05,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:05,817 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1920 transitions. [2022-11-21 16:58:05,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 16:58:05,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:05,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:58:05,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:58:05,820 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:58:05,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:05,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1735010280, now seen corresponding path program 1 times [2022-11-21 16:58:05,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:58:05,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861833775] [2022-11-21 16:58:05,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:05,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:58:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:06,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:58:06,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:58:06,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861833775] [2022-11-21 16:58:06,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861833775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:06,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:06,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:58:06,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676242052] [2022-11-21 16:58:06,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:06,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:58:06,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:58:06,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:58:06,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:58:06,188 INFO L87 Difference]: Start difference. First operand 618 states and 1920 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 16:58:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:06,282 INFO L93 Difference]: Finished difference Result 786 states and 2376 transitions. [2022-11-21 16:58:06,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:58:06,283 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 16:58:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:06,288 INFO L225 Difference]: With dead ends: 786 [2022-11-21 16:58:06,289 INFO L226 Difference]: Without dead ends: 786 [2022-11-21 16:58:06,290 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 16:58:06,293 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:06,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:58:06,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2022-11-21 16:58:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 610. [2022-11-21 16:58:06,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 608 states have (on average 3.1052631578947367) internal successors, (1888), 609 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states 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 16:58:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1888 transitions. [2022-11-21 16:58:06,319 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1888 transitions. Word has length 9 [2022-11-21 16:58:06,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:06,319 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 1888 transitions. [2022-11-21 16:58:06,319 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 16:58:06,320 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1888 transitions. [2022-11-21 16:58:06,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 16:58:06,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:06,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:58:06,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:58:06,323 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:58:06,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:06,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2049255364, now seen corresponding path program 1 times [2022-11-21 16:58:06,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:58:06,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607375188] [2022-11-21 16:58:06,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:06,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:58:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:06,853 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 16:58:06,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:58:06,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607375188] [2022-11-21 16:58:06,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607375188] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:06,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:06,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:58:06,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242075941] [2022-11-21 16:58:06,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:06,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:58:06,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:58:06,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:58:06,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:58:06,856 INFO L87 Difference]: Start difference. First operand 610 states and 1888 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:07,067 INFO L93 Difference]: Finished difference Result 618 states and 1840 transitions. [2022-11-21 16:58:07,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:58:07,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 16:58:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:07,072 INFO L225 Difference]: With dead ends: 618 [2022-11-21 16:58:07,072 INFO L226 Difference]: Without dead ends: 522 [2022-11-21 16:58:07,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:58:07,074 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:07,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 25 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:58:07,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-11-21 16:58:07,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2022-11-21 16:58:07,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 520 states have (on average 3.046153846153846) internal successors, (1584), 521 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states 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 16:58:07,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1584 transitions. [2022-11-21 16:58:07,092 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1584 transitions. Word has length 10 [2022-11-21 16:58:07,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:07,093 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 1584 transitions. [2022-11-21 16:58:07,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:07,093 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1584 transitions. [2022-11-21 16:58:07,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 16:58:07,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:07,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:58:07,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:58:07,095 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:58:07,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:07,095 INFO L85 PathProgramCache]: Analyzing trace with hash 856231669, now seen corresponding path program 1 times [2022-11-21 16:58:07,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:58:07,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031474479] [2022-11-21 16:58:07,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:07,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:58:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:07,386 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 16:58:07,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:58:07,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031474479] [2022-11-21 16:58:07,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031474479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:07,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:07,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:58:07,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285174763] [2022-11-21 16:58:07,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:07,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:58:07,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:58:07,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:58:07,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:58:07,392 INFO L87 Difference]: Start difference. First operand 522 states and 1584 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:07,497 INFO L93 Difference]: Finished difference Result 447 states and 1169 transitions. [2022-11-21 16:58:07,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:58:07,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-21 16:58:07,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:07,500 INFO L225 Difference]: With dead ends: 447 [2022-11-21 16:58:07,500 INFO L226 Difference]: Without dead ends: 351 [2022-11-21 16:58:07,501 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 16:58:07,501 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 38 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:07,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 6 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:58:07,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-11-21 16:58:07,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2022-11-21 16:58:07,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 349 states have (on average 2.5787965616045847) internal successors, (900), 350 states have internal predecessors, (900), 0 states have call successors, (0), 0 states 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 16:58:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 900 transitions. [2022-11-21 16:58:07,512 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 900 transitions. Word has length 11 [2022-11-21 16:58:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:07,513 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 900 transitions. [2022-11-21 16:58:07,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:07,513 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 900 transitions. [2022-11-21 16:58:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:58:07,514 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:07,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:58:07,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:58:07,514 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:58:07,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1600403704, now seen corresponding path program 1 times [2022-11-21 16:58:07,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:58:07,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115113418] [2022-11-21 16:58:07,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:07,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:58:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:07,790 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 16:58:07,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:58:07,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115113418] [2022-11-21 16:58:07,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115113418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:07,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:07,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:58:07,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435283194] [2022-11-21 16:58:07,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:07,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:58:07,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:58:07,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:58:07,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:58:07,794 INFO L87 Difference]: Start difference. First operand 351 states and 900 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:07,930 INFO L93 Difference]: Finished difference Result 243 states and 551 transitions. [2022-11-21 16:58:07,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:58:07,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 16:58:07,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:07,931 INFO L225 Difference]: With dead ends: 243 [2022-11-21 16:58:07,932 INFO L226 Difference]: Without dead ends: 192 [2022-11-21 16:58:07,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:58:07,932 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 71 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:07,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 8 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:58:07,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-21 16:58:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-11-21 16:58:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 2.2263157894736842) internal successors, (423), 191 states have internal predecessors, (423), 0 states have call successors, (0), 0 states 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 16:58:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 423 transitions. [2022-11-21 16:58:07,939 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 423 transitions. Word has length 14 [2022-11-21 16:58:07,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:07,939 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 423 transitions. [2022-11-21 16:58:07,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:07,940 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 423 transitions. [2022-11-21 16:58:07,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 16:58:07,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:07,940 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 16:58:07,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:58:07,941 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:58:07,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:07,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1733792556, now seen corresponding path program 1 times [2022-11-21 16:58:07,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:58:07,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835937788] [2022-11-21 16:58:07,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:07,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:58:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:08,239 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 16:58:08,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:58:08,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835937788] [2022-11-21 16:58:08,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835937788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:08,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:08,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:58:08,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927361490] [2022-11-21 16:58:08,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:08,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:58:08,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:58:08,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:58:08,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:58:08,244 INFO L87 Difference]: Start difference. First operand 192 states and 423 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:08,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:08,370 INFO L93 Difference]: Finished difference Result 263 states and 560 transitions. [2022-11-21 16:58:08,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:58:08,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 16:58:08,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:08,372 INFO L225 Difference]: With dead ends: 263 [2022-11-21 16:58:08,372 INFO L226 Difference]: Without dead ends: 263 [2022-11-21 16:58:08,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:58:08,373 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 24 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:08,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 4 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:58:08,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-21 16:58:08,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 244. [2022-11-21 16:58:08,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 242 states have (on average 2.2148760330578514) internal successors, (536), 243 states have internal predecessors, (536), 0 states have call successors, (0), 0 states 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 16:58:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 536 transitions. [2022-11-21 16:58:08,382 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 536 transitions. Word has length 17 [2022-11-21 16:58:08,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:08,383 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 536 transitions. [2022-11-21 16:58:08,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:08,383 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 536 transitions. [2022-11-21 16:58:08,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 16:58:08,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:08,385 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 16:58:08,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:58:08,385 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:58:08,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:08,386 INFO L85 PathProgramCache]: Analyzing trace with hash -196368419, now seen corresponding path program 1 times [2022-11-21 16:58:08,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:58:08,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827313946] [2022-11-21 16:58:08,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:08,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:58:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:08,734 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 16:58:08,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:58:08,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827313946] [2022-11-21 16:58:08,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827313946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:08,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:08,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:58:08,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405421746] [2022-11-21 16:58:08,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:08,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:58:08,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:58:08,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:58:08,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:58:08,741 INFO L87 Difference]: Start difference. First operand 244 states and 536 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 16:58:08,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:08,863 INFO L93 Difference]: Finished difference Result 201 states and 439 transitions. [2022-11-21 16:58:08,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:58:08,863 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 16:58:08,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:08,864 INFO L225 Difference]: With dead ends: 201 [2022-11-21 16:58:08,864 INFO L226 Difference]: Without dead ends: 181 [2022-11-21 16:58:08,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:58:08,865 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 87 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:08,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 6 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:58:08,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-21 16:58:08,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-11-21 16:58:08,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 2.2513966480446927) internal successors, (403), 180 states have internal predecessors, (403), 0 states have call successors, (0), 0 states 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 16:58:08,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 403 transitions. [2022-11-21 16:58:08,871 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 403 transitions. Word has length 17 [2022-11-21 16:58:08,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:08,871 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 403 transitions. [2022-11-21 16:58:08,871 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 16:58:08,872 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 403 transitions. [2022-11-21 16:58:08,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 16:58:08,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:08,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:58:08,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:58:08,873 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:58:08,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:08,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1599725145, now seen corresponding path program 1 times [2022-11-21 16:58:08,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:58:08,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917651340] [2022-11-21 16:58:08,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:08,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:58:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:10,211 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 16:58:10,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:58:10,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917651340] [2022-11-21 16:58:10,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917651340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:10,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:10,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:58:10,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708205275] [2022-11-21 16:58:10,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:10,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:58:10,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:58:10,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:58:10,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:58:10,213 INFO L87 Difference]: Start difference. First operand 181 states and 403 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:10,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:10,492 INFO L93 Difference]: Finished difference Result 215 states and 458 transitions. [2022-11-21 16:58:10,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:58:10,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-21 16:58:10,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:10,494 INFO L225 Difference]: With dead ends: 215 [2022-11-21 16:58:10,494 INFO L226 Difference]: Without dead ends: 215 [2022-11-21 16:58:10,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:58:10,495 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 45 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:10,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 25 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:58:10,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-21 16:58:10,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 173. [2022-11-21 16:58:10,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 171 states have (on average 2.2514619883040936) internal successors, (385), 172 states have internal predecessors, (385), 0 states have call successors, (0), 0 states 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 16:58:10,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 385 transitions. [2022-11-21 16:58:10,501 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 385 transitions. Word has length 20 [2022-11-21 16:58:10,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:10,501 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 385 transitions. [2022-11-21 16:58:10,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:10,502 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 385 transitions. [2022-11-21 16:58:10,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 16:58:10,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:10,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:58:10,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:58:10,517 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:58:10,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:10,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1003032793, now seen corresponding path program 2 times [2022-11-21 16:58:10,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:58:10,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153490079] [2022-11-21 16:58:10,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:10,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:58:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:58:10,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:58:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:58:10,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:58:10,688 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:58:10,689 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-21 16:58:10,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-21 16:58:10,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-21 16:58:10,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-21 16:58:10,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-21 16:58:10,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-21 16:58:10,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-21 16:58:10,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-21 16:58:10,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-21 16:58:10,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-21 16:58:10,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-21 16:58:10,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-21 16:58:10,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-21 16:58:10,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:58:10,698 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:58:10,704 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 16:58:10,704 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:58:10,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:58:10 BasicIcfg [2022-11-21 16:58:10,794 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:58:10,795 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:58:10,795 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:58:10,795 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:58:10,796 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:57:58" (3/4) ... [2022-11-21 16:58:10,799 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 16:58:10,799 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:58:10,799 INFO L158 Benchmark]: Toolchain (without parser) took 13860.08ms. Allocated memory was 180.4MB in the beginning and 270.5MB in the end (delta: 90.2MB). Free memory was 133.3MB in the beginning and 199.3MB in the end (delta: -66.0MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2022-11-21 16:58:10,800 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 123.7MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:58:10,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 653.76ms. Allocated memory is still 180.4MB. Free memory was 132.8MB in the beginning and 109.2MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-21 16:58:10,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.97ms. Allocated memory is still 180.4MB. Free memory was 109.2MB in the beginning and 106.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:58:10,801 INFO L158 Benchmark]: Boogie Preprocessor took 36.10ms. Allocated memory is still 180.4MB. Free memory was 106.3MB in the beginning and 104.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:58:10,801 INFO L158 Benchmark]: RCFGBuilder took 879.20ms. Allocated memory is still 180.4MB. Free memory was 104.2MB in the beginning and 117.7MB in the end (delta: -13.5MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2022-11-21 16:58:10,801 INFO L158 Benchmark]: TraceAbstraction took 12227.73ms. Allocated memory was 180.4MB in the beginning and 270.5MB in the end (delta: 90.2MB). Free memory was 116.7MB in the beginning and 199.3MB in the end (delta: -82.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2022-11-21 16:58:10,802 INFO L158 Benchmark]: Witness Printer took 3.83ms. Allocated memory is still 270.5MB. Free memory is still 199.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:58:10,803 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 123.7MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 653.76ms. Allocated memory is still 180.4MB. Free memory was 132.8MB in the beginning and 109.2MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.97ms. Allocated memory is still 180.4MB. Free memory was 109.2MB in the beginning and 106.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.10ms. Allocated memory is still 180.4MB. Free memory was 106.3MB in the beginning and 104.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 879.20ms. Allocated memory is still 180.4MB. Free memory was 104.2MB in the beginning and 117.7MB in the end (delta: -13.5MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12227.73ms. Allocated memory was 180.4MB in the beginning and 270.5MB in the end (delta: 90.2MB). Free memory was 116.7MB in the beginning and 199.3MB in the end (delta: -82.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Witness Printer took 3.83ms. Allocated memory is still 270.5MB. Free memory is still 199.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 134 PlacesBefore, 43 PlacesAfterwards, 126 TransitionsBefore, 34 TransitionsAfterwards, 2124 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 127 TotalNumberOfCompositions, 5370 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2808, independent: 2645, independent conditional: 0, independent unconditional: 2645, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1568, independent: 1521, independent conditional: 0, independent unconditional: 1521, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1568, independent: 1503, independent conditional: 0, independent unconditional: 1503, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 396, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 366, dependent conditional: 0, dependent unconditional: 366, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2808, independent: 1124, independent conditional: 0, independent unconditional: 1124, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 1568, unknown conditional: 0, unknown unconditional: 1568] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 134, Positive conditional cache size: 0, Positive unconditional cache size: 134, 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t418; [L844] FCALL, FORK 0 pthread_create(&t418, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t418, ((void *)0), P0, ((void *)0))=-2, t418={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t419; [L846] FCALL, FORK 0 pthread_create(&t419, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t419, ((void *)0), P1, ((void *)0))=-1, t418={5:0}, t419={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] 0 pthread_t t420; [L848] FCALL, FORK 0 pthread_create(&t420, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t420, ((void *)0), P2, ((void *)0))=0, t418={5:0}, t419={6:0}, t420={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 y$flush_delayed = weak$$choice2 [L805] 3 y$mem_tmp = y [L806] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L807] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L808] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L809] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L810] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L812] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 __unbuffered_p2_EAX = y [L814] 3 y = y$flush_delayed ? y$mem_tmp : y [L815] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L747] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t418={5:0}, t419={6:0}, t420={3:0}, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L861] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 844]: 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: 846]: 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: 848]: 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: 12.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 311 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 311 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 681 IncrementalHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 27 mSDtfsCounter, 681 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=788occurred in iteration=0, InterpolantAutomatonStates: 43, 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, 237 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 912 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 16:58:10,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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_c269120d-cfc9-4882-837b-0a5c9f95faca/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 2135a1882b0d27098e68a161f8694a670a72069d61776627736073247b8e4e23 --- 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 16:58:13,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:58:13,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:58:13,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:58:13,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:58:13,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:58:13,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:58:13,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:58:13,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:58:13,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:58:13,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:58:13,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:58:13,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:58:13,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:58:13,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:58:13,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:58:13,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:58:13,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:58:13,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:58:13,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:58:13,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:58:13,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:58:13,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:58:13,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:58:13,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:58:13,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:58:13,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:58:13,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:58:13,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:58:13,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:58:13,438 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:58:13,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:58:13,439 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:58:13,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:58:13,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:58:13,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:58:13,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:58:13,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:58:13,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:58:13,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:58:13,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:58:13,479 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-21 16:58:13,525 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:58:13,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:58:13,527 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:58:13,527 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:58:13,528 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:58:13,529 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:58:13,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:58:13,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:58:13,530 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:58:13,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:58:13,531 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:58:13,532 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:58:13,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:58:13,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:58:13,533 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:58:13,533 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 16:58:13,533 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 16:58:13,533 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 16:58:13,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:58:13,534 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:58:13,534 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-21 16:58:13,534 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-21 16:58:13,535 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:58:13,535 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:58:13,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:58:13,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:58:13,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:58:13,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:58:13,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:58:13,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:58:13,537 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-21 16:58:13,537 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-21 16:58:13,538 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-21 16:58:13,538 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_c269120d-cfc9-4882-837b-0a5c9f95faca/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_c269120d-cfc9-4882-837b-0a5c9f95faca/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 -> 2135a1882b0d27098e68a161f8694a670a72069d61776627736073247b8e4e23 [2022-11-21 16:58:13,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:58:13,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:58:13,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:58:13,996 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:58:13,997 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:58:13,998 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i [2022-11-21 16:58:17,073 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:58:17,440 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:58:17,440 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i [2022-11-21 16:58:17,456 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/data/f5f986cb9/98e00cb5b31e43859e33dfd1af95fd7d/FLAGe8b454ef7 [2022-11-21 16:58:17,486 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/data/f5f986cb9/98e00cb5b31e43859e33dfd1af95fd7d [2022-11-21 16:58:17,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:58:17,490 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:58:17,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:58:17,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:58:17,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:58:17,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:58:17" (1/1) ... [2022-11-21 16:58:17,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f0984cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:58:17, skipping insertion in model container [2022-11-21 16:58:17,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:58:17" (1/1) ... [2022-11-21 16:58:17,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:58:17,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:58:17,804 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_c269120d-cfc9-4882-837b-0a5c9f95faca/sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i[956,969] [2022-11-21 16:58:18,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:58:18,149 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:58:18,165 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_c269120d-cfc9-4882-837b-0a5c9f95faca/sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i[956,969] [2022-11-21 16:58:18,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:58:18,281 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:58:18,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:58:18 WrapperNode [2022-11-21 16:58:18,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:58:18,283 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:58:18,283 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:58:18,283 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:58:18,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:58:18" (1/1) ... [2022-11-21 16:58:18,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:58:18" (1/1) ... [2022-11-21 16:58:18,375 INFO L138 Inliner]: procedures = 179, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2022-11-21 16:58:18,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:58:18,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:58:18,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:58:18,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:58:18,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:58:18" (1/1) ... [2022-11-21 16:58:18,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:58:18" (1/1) ... [2022-11-21 16:58:18,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:58:18" (1/1) ... [2022-11-21 16:58:18,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:58:18" (1/1) ... [2022-11-21 16:58:18,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:58:18" (1/1) ... [2022-11-21 16:58:18,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:58:18" (1/1) ... [2022-11-21 16:58:18,451 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:58:18" (1/1) ... [2022-11-21 16:58:18,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:58:18" (1/1) ... [2022-11-21 16:58:18,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:58:18,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:58:18,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:58:18,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:58:18,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:58:18" (1/1) ... [2022-11-21 16:58:18,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:58:18,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:58:18,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:58:18,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:58:18,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:58:18,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:58:18,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:58:18,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:58:18,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-21 16:58:18,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-21 16:58:18,566 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 16:58:18,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 16:58:18,567 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 16:58:18,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 16:58:18,568 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 16:58:18,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 16:58:18,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:58:18,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:58:18,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:58:18,570 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 16:58:18,788 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:58:18,796 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:58:19,207 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:58:19,487 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:58:19,489 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:58:19,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:58:19 BoogieIcfgContainer [2022-11-21 16:58:19,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:58:19,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:58:19,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:58:19,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:58:19,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:58:17" (1/3) ... [2022-11-21 16:58:19,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350b22d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:58:19, skipping insertion in model container [2022-11-21 16:58:19,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:58:18" (2/3) ... [2022-11-21 16:58:19,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350b22d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:58:19, skipping insertion in model container [2022-11-21 16:58:19,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:58:19" (3/3) ... [2022-11-21 16:58:19,503 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_pso.opt_tso.opt.i [2022-11-21 16:58:19,524 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:58:19,524 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-21 16:58:19,524 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:58:19,627 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 16:58:19,675 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 16:58:19,696 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 127 transitions, 269 flow [2022-11-21 16:58:19,702 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 127 transitions, 269 flow [2022-11-21 16:58:19,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 269 flow [2022-11-21 16:58:19,801 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-11-21 16:58:19,802 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:58:19,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-11-21 16:58:19,812 INFO L119 LiptonReduction]: Number of co-enabled transitions 2124 [2022-11-21 16:58:28,772 INFO L134 LiptonReduction]: Checked pairs total: 5297 [2022-11-21 16:58:28,772 INFO L136 LiptonReduction]: Total number of compositions: 127 [2022-11-21 16:58:28,782 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 34 transitions, 83 flow [2022-11-21 16:58:28,895 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 788 states, 777 states have (on average 3.2741312741312742) internal successors, (2544), 787 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states 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 16:58:28,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:58:28,931 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;@45374d77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:58:28,932 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-21 16:58:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 788 states, 777 states have (on average 3.2741312741312742) internal successors, (2544), 787 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states 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 16:58:28,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 16:58:28,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:28,941 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 16:58:28,942 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:58:28,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:28,947 INFO L85 PathProgramCache]: Analyzing trace with hash 560, now seen corresponding path program 1 times [2022-11-21 16:58:28,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:58:28,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306057505] [2022-11-21 16:58:28,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:28,961 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 16:58:28,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:58:28,967 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:28,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:29,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-21 16:58:29,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:58:29,067 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 16:58:29,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:58:29,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:58:29,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306057505] [2022-11-21 16:58:29,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306057505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:29,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:29,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 16:58:29,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136065293] [2022-11-21 16:58:29,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:29,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:58:29,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:58:29,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:58:29,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:58:29,101 INFO L87 Difference]: Start difference. First operand has 788 states, 777 states have (on average 3.2741312741312742) internal successors, (2544), 787 states have internal predecessors, (2544), 0 states have call successors, (0), 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 16:58:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:29,258 INFO L93 Difference]: Finished difference Result 746 states and 2336 transitions. [2022-11-21 16:58:29,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:58:29,273 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 16:58:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:29,314 INFO L225 Difference]: With dead ends: 746 [2022-11-21 16:58:29,314 INFO L226 Difference]: Without dead ends: 746 [2022-11-21 16:58:29,315 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 16:58:29,318 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:29,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:58:29,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-11-21 16:58:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2022-11-21 16:58:29,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 741 states have (on average 3.1524966261808367) internal successors, (2336), 745 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states 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 16:58:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 2336 transitions. [2022-11-21 16:58:29,445 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 2336 transitions. Word has length 1 [2022-11-21 16:58:29,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:29,445 INFO L495 AbstractCegarLoop]: Abstraction has 746 states and 2336 transitions. [2022-11-21 16:58:29,446 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 16:58:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 2336 transitions. [2022-11-21 16:58:29,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-21 16:58:29,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:29,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:58:29,459 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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)] Ended with exit code 0 [2022-11-21 16:58:29,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:29,659 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:58:29,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:29,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1171140204, now seen corresponding path program 1 times [2022-11-21 16:58:29,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:58:29,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438408383] [2022-11-21 16:58:29,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:29,666 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 16:58:29,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:58:29,669 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:29,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:29,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:58:29,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:58:29,847 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 16:58:29,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:58:29,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:58:29,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438408383] [2022-11-21 16:58:29,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438408383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:29,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:29,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:58:29,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584481874] [2022-11-21 16:58:29,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:29,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:58:29,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:58:29,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:58:29,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:58:29,856 INFO L87 Difference]: Start difference. First operand 746 states and 2336 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:29,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:29,980 INFO L93 Difference]: Finished difference Result 634 states and 1960 transitions. [2022-11-21 16:58:29,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:58:29,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-21 16:58:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:29,986 INFO L225 Difference]: With dead ends: 634 [2022-11-21 16:58:29,995 INFO L226 Difference]: Without dead ends: 618 [2022-11-21 16:58:29,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:58:29,996 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:29,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:58:30,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-11-21 16:58:30,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2022-11-21 16:58:30,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 616 states have (on average 3.116883116883117) internal successors, (1920), 617 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states 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 16:58:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1920 transitions. [2022-11-21 16:58:30,037 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 1920 transitions. Word has length 7 [2022-11-21 16:58:30,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:30,038 INFO L495 AbstractCegarLoop]: Abstraction has 618 states and 1920 transitions. [2022-11-21 16:58:30,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:30,039 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1920 transitions. [2022-11-21 16:58:30,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 16:58:30,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:30,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:58:30,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:30,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:30,253 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:58:30,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:30,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1416730925, now seen corresponding path program 1 times [2022-11-21 16:58:30,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:58:30,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680963837] [2022-11-21 16:58:30,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:30,255 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 16:58:30,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:58:30,258 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:30,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:30,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:58:30,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:58:30,467 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 16:58:30,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:58:30,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:58:30,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680963837] [2022-11-21 16:58:30,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680963837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:30,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:30,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:58:30,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776363311] [2022-11-21 16:58:30,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:30,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:58:30,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:58:30,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:58:30,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:58:30,471 INFO L87 Difference]: Start difference. First operand 618 states and 1920 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 16:58:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:30,656 INFO L93 Difference]: Finished difference Result 489 states and 1289 transitions. [2022-11-21 16:58:30,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:58:30,658 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 16:58:30,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:30,660 INFO L225 Difference]: With dead ends: 489 [2022-11-21 16:58:30,661 INFO L226 Difference]: Without dead ends: 393 [2022-11-21 16:58:30,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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 16:58:30,662 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 40 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:30,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 6 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:58:30,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-11-21 16:58:30,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2022-11-21 16:58:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 391 states have (on average 2.608695652173913) internal successors, (1020), 392 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states 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 16:58:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1020 transitions. [2022-11-21 16:58:30,692 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1020 transitions. Word has length 10 [2022-11-21 16:58:30,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:30,692 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 1020 transitions. [2022-11-21 16:58:30,692 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 16:58:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1020 transitions. [2022-11-21 16:58:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 16:58:30,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:30,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:58:30,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:30,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:30,914 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:58:30,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:30,914 INFO L85 PathProgramCache]: Analyzing trace with hash -653407675, now seen corresponding path program 1 times [2022-11-21 16:58:30,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:58:30,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076412660] [2022-11-21 16:58:30,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:30,915 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 16:58:30,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:58:30,917 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:30,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:31,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:58:31,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:58:31,071 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 16:58:31,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:58:31,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:58:31,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076412660] [2022-11-21 16:58:31,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076412660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:31,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:31,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:58:31,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864323943] [2022-11-21 16:58:31,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:31,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:58:31,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:58:31,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:58:31,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:58:31,075 INFO L87 Difference]: Start difference. First operand 393 states and 1020 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 16:58:31,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:31,239 INFO L93 Difference]: Finished difference Result 249 states and 563 transitions. [2022-11-21 16:58:31,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:58:31,240 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 16:58:31,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:31,241 INFO L225 Difference]: With dead ends: 249 [2022-11-21 16:58:31,241 INFO L226 Difference]: Without dead ends: 198 [2022-11-21 16:58:31,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:58:31,242 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 63 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:31,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 10 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:58:31,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-21 16:58:31,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-11-21 16:58:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 196 states have (on average 2.2193877551020407) internal successors, (435), 197 states have internal predecessors, (435), 0 states have call successors, (0), 0 states 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 16:58:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 435 transitions. [2022-11-21 16:58:31,250 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 435 transitions. Word has length 13 [2022-11-21 16:58:31,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:31,251 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 435 transitions. [2022-11-21 16:58:31,251 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 16:58:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 435 transitions. [2022-11-21 16:58:31,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 16:58:31,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:31,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:58:31,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:31,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:31,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:58:31,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:31,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1995744663, now seen corresponding path program 1 times [2022-11-21 16:58:31,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:58:31,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830590899] [2022-11-21 16:58:31,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:31,466 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 16:58:31,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:58:31,467 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:31,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:31,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:58:31,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:58:31,643 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 16:58:31,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:58:31,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:58:31,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830590899] [2022-11-21 16:58:31,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830590899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:31,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:31,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:58:31,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262553570] [2022-11-21 16:58:31,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:31,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:58:31,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:58:31,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:58:31,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:58:31,646 INFO L87 Difference]: Start difference. First operand 198 states and 435 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:31,871 INFO L93 Difference]: Finished difference Result 155 states and 347 transitions. [2022-11-21 16:58:31,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:58:31,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 16:58:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:31,872 INFO L225 Difference]: With dead ends: 155 [2022-11-21 16:58:31,873 INFO L226 Difference]: Without dead ends: 143 [2022-11-21 16:58:31,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:58:31,874 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 71 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:31,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 18 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:58:31,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-21 16:58:31,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-11-21 16:58:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 141 states have (on average 2.3049645390070923) internal successors, (325), 142 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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 16:58:31,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 325 transitions. [2022-11-21 16:58:31,880 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 325 transitions. Word has length 16 [2022-11-21 16:58:31,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:31,880 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 325 transitions. [2022-11-21 16:58:31,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:58:31,881 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 325 transitions. [2022-11-21 16:58:31,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:58:31,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:31,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:58:31,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:32,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:32,094 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:58:32,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:32,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1754824630, now seen corresponding path program 1 times [2022-11-21 16:58:32,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:58:32,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731892528] [2022-11-21 16:58:32,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:32,096 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 16:58:32,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:58:32,097 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:32,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:32,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:58:32,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:58:32,315 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 16:58:32,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:58:32,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:58:32,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731892528] [2022-11-21 16:58:32,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731892528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:32,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:32,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:58:32,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437914942] [2022-11-21 16:58:32,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:32,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:58:32,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:58:32,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:58:32,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:58:32,318 INFO L87 Difference]: Start difference. First operand 143 states and 325 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 16:58:32,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:32,523 INFO L93 Difference]: Finished difference Result 183 states and 404 transitions. [2022-11-21 16:58:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:58:32,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 16:58:32,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:32,526 INFO L225 Difference]: With dead ends: 183 [2022-11-21 16:58:32,526 INFO L226 Difference]: Without dead ends: 183 [2022-11-21 16:58:32,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:58:32,527 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:32,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 7 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:58:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-21 16:58:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2022-11-21 16:58:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 180 states have (on average 2.2444444444444445) internal successors, (404), 181 states have internal predecessors, (404), 0 states have call successors, (0), 0 states 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 16:58:32,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 404 transitions. [2022-11-21 16:58:32,534 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 404 transitions. Word has length 21 [2022-11-21 16:58:32,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:32,534 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 404 transitions. [2022-11-21 16:58:32,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 16:58:32,535 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 404 transitions. [2022-11-21 16:58:32,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:58:32,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:32,538 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 16:58:32,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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)] Forceful destruction successful, exit code 0 [2022-11-21 16:58:32,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:32,751 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:58:32,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:32,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1754824580, now seen corresponding path program 1 times [2022-11-21 16:58:32,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:58:32,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253038861] [2022-11-21 16:58:32,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:58:32,753 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 16:58:32,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:58:32,754 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:32,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:58:32,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-21 16:58:32,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:58:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:58:33,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:58:33,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:58:33,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253038861] [2022-11-21 16:58:33,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253038861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:33,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:33,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:58:33,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175994607] [2022-11-21 16:58:33,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:33,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:58:33,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:58:33,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:58:33,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:58:33,352 INFO L87 Difference]: Start difference. First operand 182 states and 404 transitions. Second operand has 5 states, 4 states have (on average 5.25) 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 16:58:33,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:33,551 INFO L93 Difference]: Finished difference Result 181 states and 402 transitions. [2022-11-21 16:58:33,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:58:33,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) 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 16:58:33,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:33,553 INFO L225 Difference]: With dead ends: 181 [2022-11-21 16:58:33,553 INFO L226 Difference]: Without dead ends: 76 [2022-11-21 16:58:33,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:58:33,554 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:33,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 12 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:58:33,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-21 16:58:33,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-21 16:58:33,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.96) internal successors, (147), 75 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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 16:58:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 147 transitions. [2022-11-21 16:58:33,560 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 147 transitions. Word has length 21 [2022-11-21 16:58:33,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:33,560 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 147 transitions. [2022-11-21 16:58:33,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) 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 16:58:33,560 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 147 transitions. [2022-11-21 16:58:33,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:58:33,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:33,561 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 16:58:33,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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)] Forceful destruction successful, exit code 0 [2022-11-21 16:58:33,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:33,762 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:58:33,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:33,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1506951728, now seen corresponding path program 2 times [2022-11-21 16:58:33,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:58:33,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393057439] [2022-11-21 16:58:33,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:58:33,763 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 16:58:33,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:58:33,764 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:33,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:33,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 16:58:33,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:58:33,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-21 16:58:33,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:58:34,643 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 16:58:34,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:58:34,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:58:34,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393057439] [2022-11-21 16:58:34,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393057439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:58:34,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:58:34,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:58:34,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600123663] [2022-11-21 16:58:34,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:58:34,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:58:34,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:58:34,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:58:34,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:58:34,646 INFO L87 Difference]: Start difference. First operand 76 states and 147 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 16:58:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:58:34,982 INFO L93 Difference]: Finished difference Result 95 states and 178 transitions. [2022-11-21 16:58:34,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:58:34,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 16:58:34,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:58:34,983 INFO L225 Difference]: With dead ends: 95 [2022-11-21 16:58:34,983 INFO L226 Difference]: Without dead ends: 60 [2022-11-21 16:58:34,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:58:34,984 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:58:34,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 19 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:58:34,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-21 16:58:34,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-11-21 16:58:34,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.7457627118644068) internal successors, (103), 59 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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 16:58:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 103 transitions. [2022-11-21 16:58:34,987 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 103 transitions. Word has length 21 [2022-11-21 16:58:34,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:58:34,987 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 103 transitions. [2022-11-21 16:58:34,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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 16:58:34,988 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2022-11-21 16:58:34,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:58:34,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:58:34,988 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 16:58:35,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:35,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:35,189 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:58:35,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:58:35,190 INFO L85 PathProgramCache]: Analyzing trace with hash -921854520, now seen corresponding path program 3 times [2022-11-21 16:58:35,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:58:35,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199862932] [2022-11-21 16:58:35,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:58:35,190 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 16:58:35,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:58:35,192 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:35,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 (10)] Waiting until timeout for monitored process [2022-11-21 16:58:35,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-21 16:58:35,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 16:58:35,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:58:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:58:35,532 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-21 16:58:35,532 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:58:35,533 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-21 16:58:35,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-21 16:58:35,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-21 16:58:35,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-21 16:58:35,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-21 16:58:35,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-21 16:58:35,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-21 16:58:35,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-21 16:58:35,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-21 16:58:35,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-21 16:58:35,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-21 16:58:35,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-21 16:58:35,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-21 16:58:35,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 (10)] Forceful destruction successful, exit code 0 [2022-11-21 16:58:35,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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 16:58:35,748 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2022-11-21 16:58:35,758 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 16:58:35,758 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:58:35,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:58:35 BasicIcfg [2022-11-21 16:58:35,823 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:58:35,823 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:58:35,823 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:58:35,824 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:58:35,824 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:58:19" (3/4) ... [2022-11-21 16:58:35,827 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 16:58:35,827 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:58:35,828 INFO L158 Benchmark]: Toolchain (without parser) took 18337.62ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 85.7MB in the beginning and 124.6MB in the end (delta: -39.0MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2022-11-21 16:58:35,828 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 69.2MB. Free memory is still 47.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:58:35,828 INFO L158 Benchmark]: CACSL2BoogieTranslator took 790.34ms. Allocated memory is still 109.1MB. Free memory was 85.3MB in the beginning and 61.3MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-21 16:58:35,829 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.97ms. Allocated memory is still 109.1MB. Free memory was 61.3MB in the beginning and 58.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:58:35,829 INFO L158 Benchmark]: Boogie Preprocessor took 81.77ms. Allocated memory is still 109.1MB. Free memory was 58.6MB in the beginning and 87.9MB in the end (delta: -29.3MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2022-11-21 16:58:35,829 INFO L158 Benchmark]: RCFGBuilder took 1030.59ms. Allocated memory is still 109.1MB. Free memory was 87.8MB in the beginning and 83.0MB in the end (delta: 4.9MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2022-11-21 16:58:35,830 INFO L158 Benchmark]: TraceAbstraction took 16325.93ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 82.7MB in the beginning and 124.6MB in the end (delta: -41.9MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. [2022-11-21 16:58:35,830 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 159.4MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:58:35,832 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.22ms. Allocated memory is still 69.2MB. Free memory is still 47.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 790.34ms. Allocated memory is still 109.1MB. Free memory was 85.3MB in the beginning and 61.3MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.97ms. Allocated memory is still 109.1MB. Free memory was 61.3MB in the beginning and 58.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.77ms. Allocated memory is still 109.1MB. Free memory was 58.6MB in the beginning and 87.9MB in the end (delta: -29.3MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * RCFGBuilder took 1030.59ms. Allocated memory is still 109.1MB. Free memory was 87.8MB in the beginning and 83.0MB in the end (delta: 4.9MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16325.93ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 82.7MB in the beginning and 124.6MB in the end (delta: -41.9MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 159.4MB. Free memory is still 124.6MB. 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.1s, 135 PlacesBefore, 43 PlacesAfterwards, 127 TransitionsBefore, 34 TransitionsAfterwards, 2124 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 127 TotalNumberOfCompositions, 5297 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2864, independent: 2711, independent conditional: 0, independent unconditional: 2711, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1491, independent: 1456, independent conditional: 0, independent unconditional: 1456, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1491, independent: 1436, independent conditional: 0, independent unconditional: 1436, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 55, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 341, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 289, dependent conditional: 0, dependent unconditional: 289, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2864, independent: 1255, independent conditional: 0, independent unconditional: 1255, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 1491, unknown conditional: 0, unknown unconditional: 1491] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 134, Positive conditional cache size: 0, Positive unconditional cache size: 134, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t418; [L844] FCALL, FORK 0 pthread_create(&t418, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t418, ((void *)0), P0, ((void *)0))=-1, t418={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t419; [L846] FCALL, FORK 0 pthread_create(&t419, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t419, ((void *)0), P1, ((void *)0))=0, t418={3:0}, t419={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] 0 pthread_t t420; [L848] FCALL, FORK 0 pthread_create(&t420, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t420, ((void *)0), P2, ((void *)0))=1, t418={3:0}, t419={7:0}, t420={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 y$flush_delayed = weak$$choice2 [L805] 3 y$mem_tmp = y [L806] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L807] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L808] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L809] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L810] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L812] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 __unbuffered_p2_EAX = y [L814] 3 y = y$flush_delayed ? y$mem_tmp : y [L815] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L747] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L821] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t418={3:0}, t419={7:0}, t420={15:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L861] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 844]: 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: 846]: 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: 848]: 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: 16.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 258 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 258 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 676 IncrementalHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 27 mSDtfsCounter, 676 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=788occurred in iteration=0, InterpolantAutomatonStates: 38, 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, 8 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 102 ConstructedInterpolants, 16 QuantifiedInterpolants, 1083 SizeOfPredicates, 19 NumberOfNonLiveVariables, 966 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 16:58:35,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c269120d-cfc9-4882-837b-0a5c9f95faca/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