./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix014_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f 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_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix014_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8 --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 4fc83f7400faec1e297c0070148ef6e08fc24a46b81d9a9e52a0ee501a0da326 --- 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-e04fb08 [2022-11-16 11:41:46,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:41:46,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:41:46,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:41:46,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:41:46,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:41:46,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:41:46,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:41:46,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:41:46,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:41:46,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:41:46,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:41:46,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:41:46,652 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:41:46,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:41:46,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:41:46,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:41:46,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:41:46,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:41:46,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:41:46,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:41:46,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:41:46,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:41:46,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:41:46,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:41:46,685 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:41:46,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:41:46,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:41:46,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:41:46,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:41:46,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:41:46,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:41:46,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:41:46,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:41:46,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:41:46,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:41:46,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:41:46,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:41:46,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:41:46,697 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:41:46,698 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:41:46,699 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:41:46,729 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:41:46,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:41:46,730 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:41:46,730 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:41:46,731 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:41:46,731 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:41:46,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:41:46,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:41:46,733 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:41:46,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:41:46,733 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:41:46,733 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:41:46,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:41:46,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:41:46,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:41:46,734 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:41:46,735 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:41:46,735 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:41:46,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:41:46,735 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:41:46,735 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:41:46,736 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:41:46,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:41:46,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:41:46,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:41:46,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:41:46,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:41:46,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:41:46,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:41:46,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:41:46,738 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_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8 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 -> 4fc83f7400faec1e297c0070148ef6e08fc24a46b81d9a9e52a0ee501a0da326 [2022-11-16 11:41:47,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:41:47,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:41:47,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:41:47,165 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:41:47,167 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:41:47,168 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix014_tso.oepc.i [2022-11-16 11:41:47,272 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/data/bf0db24bd/cd48f48d79dc4634bc5eb8dee36e1a5f/FLAG6b49c159b [2022-11-16 11:41:47,976 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:41:47,976 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/sv-benchmarks/c/pthread-wmm/mix014_tso.oepc.i [2022-11-16 11:41:47,997 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/data/bf0db24bd/cd48f48d79dc4634bc5eb8dee36e1a5f/FLAG6b49c159b [2022-11-16 11:41:48,209 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/data/bf0db24bd/cd48f48d79dc4634bc5eb8dee36e1a5f [2022-11-16 11:41:48,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:41:48,214 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:41:48,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:41:48,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:41:48,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:41:48,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:41:48" (1/1) ... [2022-11-16 11:41:48,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f84c491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:48, skipping insertion in model container [2022-11-16 11:41:48,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:41:48" (1/1) ... [2022-11-16 11:41:48,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:41:48,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:41:48,643 WARN L229 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_773f707b-d8fe-4fb6-9569-4933838ffb37/sv-benchmarks/c/pthread-wmm/mix014_tso.oepc.i[949,962] [2022-11-16 11:41:49,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:41:49,084 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:41:49,102 WARN L229 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_773f707b-d8fe-4fb6-9569-4933838ffb37/sv-benchmarks/c/pthread-wmm/mix014_tso.oepc.i[949,962] [2022-11-16 11:41:49,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:41:49,273 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:41:49,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:49 WrapperNode [2022-11-16 11:41:49,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:41:49,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:41:49,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:41:49,279 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:41:49,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:49" (1/1) ... [2022-11-16 11:41:49,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:49" (1/1) ... [2022-11-16 11:41:49,410 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 257 [2022-11-16 11:41:49,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:41:49,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:41:49,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:41:49,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:41:49,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:49" (1/1) ... [2022-11-16 11:41:49,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:49" (1/1) ... [2022-11-16 11:41:49,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:49" (1/1) ... [2022-11-16 11:41:49,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:49" (1/1) ... [2022-11-16 11:41:49,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:49" (1/1) ... [2022-11-16 11:41:49,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:49" (1/1) ... [2022-11-16 11:41:49,453 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:49" (1/1) ... [2022-11-16 11:41:49,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:49" (1/1) ... [2022-11-16 11:41:49,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:41:49,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:41:49,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:41:49,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:41:49,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:49" (1/1) ... [2022-11-16 11:41:49,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:41:49,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:41:49,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:41:49,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:41:49,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:41:49,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:41:49,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:41:49,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:41:49,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:41:49,596 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:41:49,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:41:49,596 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:41:49,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:41:49,597 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:41:49,597 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:41:49,597 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-16 11:41:49,598 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-16 11:41:49,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:41:49,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:41:49,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:41:49,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:41:49,601 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:41:49,802 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:41:49,805 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:41:50,721 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:41:51,117 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:41:51,117 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:41:51,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:41:51 BoogieIcfgContainer [2022-11-16 11:41:51,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:41:51,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:41:51,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:41:51,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:41:51,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:41:48" (1/3) ... [2022-11-16 11:41:51,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6b627d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:41:51, skipping insertion in model container [2022-11-16 11:41:51,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:41:49" (2/3) ... [2022-11-16 11:41:51,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6b627d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:41:51, skipping insertion in model container [2022-11-16 11:41:51,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:41:51" (3/3) ... [2022-11-16 11:41:51,136 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014_tso.oepc.i [2022-11-16 11:41:51,161 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:41:51,162 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-16 11:41:51,162 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:41:51,285 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:41:51,331 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:41:51,349 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 171 transitions, 362 flow [2022-11-16 11:41:51,353 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 171 transitions, 362 flow [2022-11-16 11:41:51,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 171 transitions, 362 flow [2022-11-16 11:41:51,522 INFO L130 PetriNetUnfolder]: 2/167 cut-off events. [2022-11-16 11:41:51,522 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:41:51,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 167 events. 2/167 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 103. Up to 2 conditions per place. [2022-11-16 11:41:51,533 INFO L119 LiptonReduction]: Number of co-enabled transitions 4044 [2022-11-16 11:42:03,190 INFO L134 LiptonReduction]: Checked pairs total: 12030 [2022-11-16 11:42:03,191 INFO L136 LiptonReduction]: Total number of compositions: 166 [2022-11-16 11:42:03,202 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 47 transitions, 114 flow [2022-11-16 11:42:03,819 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9224 states, 9197 states have (on average 4.207893878438622) internal successors, (38700), 9223 states have internal predecessors, (38700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:03,850 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:42:03,864 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;@1a26d703, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:42:03,864 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-11-16 11:42:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 9224 states, 9197 states have (on average 4.207893878438622) internal successors, (38700), 9223 states have internal predecessors, (38700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:03,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 11:42:03,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:03,938 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 11:42:03,940 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:42:03,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:03,951 INFO L85 PathProgramCache]: Analyzing trace with hash 831, now seen corresponding path program 1 times [2022-11-16 11:42:03,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:03,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614018252] [2022-11-16 11:42:03,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:03,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:04,169 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-16 11:42:04,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:04,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614018252] [2022-11-16 11:42:04,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614018252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:04,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:04,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 11:42:04,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117797593] [2022-11-16 11:42:04,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:04,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:42:04,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:04,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:42:04,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:42:04,256 INFO L87 Difference]: Start difference. First operand has 9224 states, 9197 states have (on average 4.207893878438622) internal successors, (38700), 9223 states have internal predecessors, (38700), 0 states have call successors, (0), 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-16 11:42:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:04,632 INFO L93 Difference]: Finished difference Result 8722 states and 35768 transitions. [2022-11-16 11:42:04,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:42:04,636 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-16 11:42:04,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:04,886 INFO L225 Difference]: With dead ends: 8722 [2022-11-16 11:42:04,886 INFO L226 Difference]: Without dead ends: 8722 [2022-11-16 11:42:04,887 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-16 11:42:04,891 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:04,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:42:04,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8722 states. [2022-11-16 11:42:05,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8722 to 8722. [2022-11-16 11:42:05,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8722 states, 8711 states have (on average 4.106072781540581) internal successors, (35768), 8721 states have internal predecessors, (35768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:05,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8722 states to 8722 states and 35768 transitions. [2022-11-16 11:42:05,558 INFO L78 Accepts]: Start accepts. Automaton has 8722 states and 35768 transitions. Word has length 1 [2022-11-16 11:42:05,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:05,559 INFO L495 AbstractCegarLoop]: Abstraction has 8722 states and 35768 transitions. [2022-11-16 11:42:05,559 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-16 11:42:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand 8722 states and 35768 transitions. [2022-11-16 11:42:05,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:42:05,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:05,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:42:05,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:42:05,561 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:42:05,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:05,563 INFO L85 PathProgramCache]: Analyzing trace with hash 785240839, now seen corresponding path program 1 times [2022-11-16 11:42:05,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:05,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919633454] [2022-11-16 11:42:05,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:05,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:06,294 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-16 11:42:06,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:06,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919633454] [2022-11-16 11:42:06,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919633454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:06,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:06,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:42:06,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316327625] [2022-11-16 11:42:06,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:06,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:06,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:06,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:06,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:06,305 INFO L87 Difference]: Start difference. First operand 8722 states and 35768 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:06,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:06,746 INFO L93 Difference]: Finished difference Result 7392 states and 30074 transitions. [2022-11-16 11:42:06,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:06,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-16 11:42:06,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:06,958 INFO L225 Difference]: With dead ends: 7392 [2022-11-16 11:42:06,958 INFO L226 Difference]: Without dead ends: 7272 [2022-11-16 11:42:06,959 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-16 11:42:06,960 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:06,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 8 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:42:07,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2022-11-16 11:42:07,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 7272. [2022-11-16 11:42:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7272 states, 7267 states have (on average 4.0784367689555525) internal successors, (29638), 7271 states have internal predecessors, (29638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7272 states to 7272 states and 29638 transitions. [2022-11-16 11:42:07,596 INFO L78 Accepts]: Start accepts. Automaton has 7272 states and 29638 transitions. Word has length 5 [2022-11-16 11:42:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:07,596 INFO L495 AbstractCegarLoop]: Abstraction has 7272 states and 29638 transitions. [2022-11-16 11:42:07,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 7272 states and 29638 transitions. [2022-11-16 11:42:07,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:42:07,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:07,599 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:07,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:42:07,600 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:42:07,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:07,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1297713292, now seen corresponding path program 1 times [2022-11-16 11:42:07,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:07,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949969031] [2022-11-16 11:42:07,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:07,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:07,850 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-16 11:42:07,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:07,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949969031] [2022-11-16 11:42:07,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949969031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:07,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:07,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:42:07,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85550978] [2022-11-16 11:42:07,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:07,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:07,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:07,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:07,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:07,862 INFO L87 Difference]: Start difference. First operand 7272 states and 29638 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-16 11:42:08,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:08,274 INFO L93 Difference]: Finished difference Result 5952 states and 23972 transitions. [2022-11-16 11:42:08,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:08,275 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-16 11:42:08,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:08,350 INFO L225 Difference]: With dead ends: 5952 [2022-11-16 11:42:08,350 INFO L226 Difference]: Without dead ends: 5772 [2022-11-16 11:42:08,352 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-16 11:42:08,356 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:08,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 8 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:42:08,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5772 states. [2022-11-16 11:42:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5772 to 5772. [2022-11-16 11:42:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5772 states, 5770 states have (on average 4.046447140381282) internal successors, (23348), 5771 states have internal predecessors, (23348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5772 states to 5772 states and 23348 transitions. [2022-11-16 11:42:08,702 INFO L78 Accepts]: Start accepts. Automaton has 5772 states and 23348 transitions. Word has length 7 [2022-11-16 11:42:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:08,704 INFO L495 AbstractCegarLoop]: Abstraction has 5772 states and 23348 transitions. [2022-11-16 11:42:08,704 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-16 11:42:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 5772 states and 23348 transitions. [2022-11-16 11:42:08,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:42:08,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:08,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:08,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:42:08,719 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:42:08,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:08,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1347192557, now seen corresponding path program 1 times [2022-11-16 11:42:08,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:08,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453889505] [2022-11-16 11:42:08,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:08,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:09,219 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-16 11:42:09,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:09,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453889505] [2022-11-16 11:42:09,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453889505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:09,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:09,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:42:09,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585740143] [2022-11-16 11:42:09,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:09,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:42:09,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:09,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:42:09,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:42:09,223 INFO L87 Difference]: Start difference. First operand 5772 states and 23348 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:09,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:09,659 INFO L93 Difference]: Finished difference Result 6672 states and 26438 transitions. [2022-11-16 11:42:09,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:42:09,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 11:42:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:09,722 INFO L225 Difference]: With dead ends: 6672 [2022-11-16 11:42:09,722 INFO L226 Difference]: Without dead ends: 6672 [2022-11-16 11:42:09,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:42:09,724 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 49 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:09,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 20 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:42:09,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6672 states. [2022-11-16 11:42:10,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6672 to 6072. [2022-11-16 11:42:10,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6072 states, 6070 states have (on average 4.040856672158155) internal successors, (24528), 6071 states have internal predecessors, (24528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6072 states to 6072 states and 24528 transitions. [2022-11-16 11:42:10,242 INFO L78 Accepts]: Start accepts. Automaton has 6072 states and 24528 transitions. Word has length 12 [2022-11-16 11:42:10,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:10,244 INFO L495 AbstractCegarLoop]: Abstraction has 6072 states and 24528 transitions. [2022-11-16 11:42:10,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:10,245 INFO L276 IsEmpty]: Start isEmpty. Operand 6072 states and 24528 transitions. [2022-11-16 11:42:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:42:10,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:10,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:10,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:42:10,248 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:42:10,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:10,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1347192501, now seen corresponding path program 1 times [2022-11-16 11:42:10,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:10,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705005916] [2022-11-16 11:42:10,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:10,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:11,480 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-16 11:42:11,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:11,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705005916] [2022-11-16 11:42:11,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705005916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:11,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:11,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:42:11,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060159734] [2022-11-16 11:42:11,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:11,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:42:11,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:11,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:42:11,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:42:11,483 INFO L87 Difference]: Start difference. First operand 6072 states and 24528 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:12,007 INFO L93 Difference]: Finished difference Result 5172 states and 20088 transitions. [2022-11-16 11:42:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:42:12,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 11:42:12,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:12,056 INFO L225 Difference]: With dead ends: 5172 [2022-11-16 11:42:12,056 INFO L226 Difference]: Without dead ends: 4272 [2022-11-16 11:42:12,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:42:12,059 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:12,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 32 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:42:12,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2022-11-16 11:42:12,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 4272. [2022-11-16 11:42:12,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4272 states, 4271 states have (on average 3.94474361976118) internal successors, (16848), 4271 states have internal predecessors, (16848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:12,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4272 states to 4272 states and 16848 transitions. [2022-11-16 11:42:12,332 INFO L78 Accepts]: Start accepts. Automaton has 4272 states and 16848 transitions. Word has length 12 [2022-11-16 11:42:12,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:12,332 INFO L495 AbstractCegarLoop]: Abstraction has 4272 states and 16848 transitions. [2022-11-16 11:42:12,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:12,333 INFO L276 IsEmpty]: Start isEmpty. Operand 4272 states and 16848 transitions. [2022-11-16 11:42:12,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:42:12,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:12,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:12,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:42:12,337 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:42:12,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:12,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1867352685, now seen corresponding path program 1 times [2022-11-16 11:42:12,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:12,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500213893] [2022-11-16 11:42:12,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:12,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:13,051 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-16 11:42:13,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:13,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500213893] [2022-11-16 11:42:13,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500213893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:13,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:13,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:42:13,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216812538] [2022-11-16 11:42:13,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:13,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:42:13,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:13,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:42:13,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:42:13,053 INFO L87 Difference]: Start difference. First operand 4272 states and 16848 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:13,445 INFO L93 Difference]: Finished difference Result 4472 states and 17218 transitions. [2022-11-16 11:42:13,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:42:13,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 11:42:13,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:13,471 INFO L225 Difference]: With dead ends: 4472 [2022-11-16 11:42:13,471 INFO L226 Difference]: Without dead ends: 3872 [2022-11-16 11:42:13,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:42:13,476 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 51 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:13,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 18 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:42:13,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3872 states. [2022-11-16 11:42:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3872 to 3872. [2022-11-16 11:42:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3872 states, 3871 states have (on average 3.902867476104366) internal successors, (15108), 3871 states have internal predecessors, (15108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3872 states to 3872 states and 15108 transitions. [2022-11-16 11:42:13,838 INFO L78 Accepts]: Start accepts. Automaton has 3872 states and 15108 transitions. Word has length 14 [2022-11-16 11:42:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:13,839 INFO L495 AbstractCegarLoop]: Abstraction has 3872 states and 15108 transitions. [2022-11-16 11:42:13,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3872 states and 15108 transitions. [2022-11-16 11:42:13,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:42:13,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:13,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:13,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:42:13,847 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:42:13,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash 756085124, now seen corresponding path program 1 times [2022-11-16 11:42:13,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:13,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247371290] [2022-11-16 11:42:13,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:13,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:14,309 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-16 11:42:14,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:14,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247371290] [2022-11-16 11:42:14,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247371290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:14,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:14,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:42:14,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882859719] [2022-11-16 11:42:14,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:14,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:14,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:14,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:14,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:14,316 INFO L87 Difference]: Start difference. First operand 3872 states and 15108 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:14,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:14,491 INFO L93 Difference]: Finished difference Result 2784 states and 9668 transitions. [2022-11-16 11:42:14,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:14,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 11:42:14,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:14,508 INFO L225 Difference]: With dead ends: 2784 [2022-11-16 11:42:14,509 INFO L226 Difference]: Without dead ends: 2784 [2022-11-16 11:42:14,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:14,510 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:14,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:42:14,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2022-11-16 11:42:14,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2784. [2022-11-16 11:42:14,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2783 states have (on average 3.4739489759252606) internal successors, (9668), 2783 states have internal predecessors, (9668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 9668 transitions. [2022-11-16 11:42:14,649 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 9668 transitions. Word has length 16 [2022-11-16 11:42:14,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:14,651 INFO L495 AbstractCegarLoop]: Abstraction has 2784 states and 9668 transitions. [2022-11-16 11:42:14,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:14,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 9668 transitions. [2022-11-16 11:42:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 11:42:14,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:14,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:14,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:42:14,660 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:42:14,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:14,662 INFO L85 PathProgramCache]: Analyzing trace with hash 2139645935, now seen corresponding path program 1 times [2022-11-16 11:42:14,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:14,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756469091] [2022-11-16 11:42:14,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:14,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:15,257 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-16 11:42:15,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:15,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756469091] [2022-11-16 11:42:15,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756469091] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:15,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:15,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:42:15,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087430102] [2022-11-16 11:42:15,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:15,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:42:15,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:15,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:42:15,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:42:15,263 INFO L87 Difference]: Start difference. First operand 2784 states and 9668 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:15,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:15,491 INFO L93 Difference]: Finished difference Result 1728 states and 5444 transitions. [2022-11-16 11:42:15,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:42:15,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-16 11:42:15,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:15,499 INFO L225 Difference]: With dead ends: 1728 [2022-11-16 11:42:15,500 INFO L226 Difference]: Without dead ends: 1728 [2022-11-16 11:42:15,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:42:15,501 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 41 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:15,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 12 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:42:15,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2022-11-16 11:42:15,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1728. [2022-11-16 11:42:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1727 states have (on average 3.1522872032426172) internal successors, (5444), 1727 states have internal predecessors, (5444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 5444 transitions. [2022-11-16 11:42:15,579 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 5444 transitions. Word has length 19 [2022-11-16 11:42:15,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:15,580 INFO L495 AbstractCegarLoop]: Abstraction has 1728 states and 5444 transitions. [2022-11-16 11:42:15,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:15,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 5444 transitions. [2022-11-16 11:42:15,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:42:15,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:15,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:15,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:42:15,587 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:42:15,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:15,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1995880956, now seen corresponding path program 1 times [2022-11-16 11:42:15,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:15,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995800445] [2022-11-16 11:42:15,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:15,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:16,200 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-16 11:42:16,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:16,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995800445] [2022-11-16 11:42:16,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995800445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:16,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:16,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:42:16,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208089771] [2022-11-16 11:42:16,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:16,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:42:16,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:16,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:42:16,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:42:16,204 INFO L87 Difference]: Start difference. First operand 1728 states and 5444 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:16,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:16,472 INFO L93 Difference]: Finished difference Result 1340 states and 4280 transitions. [2022-11-16 11:42:16,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:42:16,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 11:42:16,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:16,478 INFO L225 Difference]: With dead ends: 1340 [2022-11-16 11:42:16,479 INFO L226 Difference]: Without dead ends: 1340 [2022-11-16 11:42:16,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:42:16,480 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 105 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:16,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 16 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:42:16,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2022-11-16 11:42:16,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1340. [2022-11-16 11:42:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1339 states have (on average 3.196415235250187) internal successors, (4280), 1339 states have internal predecessors, (4280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:16,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 4280 transitions. [2022-11-16 11:42:16,536 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 4280 transitions. Word has length 22 [2022-11-16 11:42:16,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:16,537 INFO L495 AbstractCegarLoop]: Abstraction has 1340 states and 4280 transitions. [2022-11-16 11:42:16,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:16,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 4280 transitions. [2022-11-16 11:42:16,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 11:42:16,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:16,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:16,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:42:16,543 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:42:16,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:16,544 INFO L85 PathProgramCache]: Analyzing trace with hash 521557673, now seen corresponding path program 1 times [2022-11-16 11:42:16,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:16,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485157361] [2022-11-16 11:42:16,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:16,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:17,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-16 11:42:17,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:17,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485157361] [2022-11-16 11:42:17,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485157361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:17,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:17,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:42:17,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631686708] [2022-11-16 11:42:17,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:17,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:42:17,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:17,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:42:17,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:42:17,352 INFO L87 Difference]: Start difference. First operand 1340 states and 4280 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:17,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:17,984 INFO L93 Difference]: Finished difference Result 1749 states and 5468 transitions. [2022-11-16 11:42:17,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:42:17,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-11-16 11:42:17,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:17,990 INFO L225 Difference]: With dead ends: 1749 [2022-11-16 11:42:17,990 INFO L226 Difference]: Without dead ends: 1346 [2022-11-16 11:42:17,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:42:17,991 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 60 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:17,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 25 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:42:17,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2022-11-16 11:42:18,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1340. [2022-11-16 11:42:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1339 states have (on average 3.1053024645257654) internal successors, (4158), 1339 states have internal predecessors, (4158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:18,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 4158 transitions. [2022-11-16 11:42:18,041 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 4158 transitions. Word has length 26 [2022-11-16 11:42:18,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:18,041 INFO L495 AbstractCegarLoop]: Abstraction has 1340 states and 4158 transitions. [2022-11-16 11:42:18,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 4158 transitions. [2022-11-16 11:42:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 11:42:18,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:18,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:18,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:42:18,048 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:42:18,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:18,049 INFO L85 PathProgramCache]: Analyzing trace with hash 444886441, now seen corresponding path program 2 times [2022-11-16 11:42:18,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:18,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873617933] [2022-11-16 11:42:18,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:18,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:18,626 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-16 11:42:18,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:18,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873617933] [2022-11-16 11:42:18,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873617933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:18,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:18,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:42:18,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391787106] [2022-11-16 11:42:18,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:18,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:42:18,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:18,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:42:18,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:42:18,630 INFO L87 Difference]: Start difference. First operand 1340 states and 4158 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:18,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:18,890 INFO L93 Difference]: Finished difference Result 1276 states and 4032 transitions. [2022-11-16 11:42:18,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:42:18,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-11-16 11:42:18,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:18,893 INFO L225 Difference]: With dead ends: 1276 [2022-11-16 11:42:18,893 INFO L226 Difference]: Without dead ends: 620 [2022-11-16 11:42:18,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:42:18,894 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 109 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:18,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 15 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:42:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2022-11-16 11:42:18,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2022-11-16 11:42:18,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 2.9402261712439417) internal successors, (1820), 619 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:18,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1820 transitions. [2022-11-16 11:42:18,916 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1820 transitions. Word has length 26 [2022-11-16 11:42:18,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:18,917 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 1820 transitions. [2022-11-16 11:42:18,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:18,918 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1820 transitions. [2022-11-16 11:42:18,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 11:42:18,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:18,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:18,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:42:18,922 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:42:18,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:18,923 INFO L85 PathProgramCache]: Analyzing trace with hash -744730086, now seen corresponding path program 1 times [2022-11-16 11:42:18,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:18,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753141766] [2022-11-16 11:42:18,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:18,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:19,756 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-16 11:42:19,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:19,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753141766] [2022-11-16 11:42:19,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753141766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:19,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:19,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:42:19,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314660203] [2022-11-16 11:42:19,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:19,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:42:19,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:19,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:42:19,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:42:19,758 INFO L87 Difference]: Start difference. First operand 620 states and 1820 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:20,213 INFO L93 Difference]: Finished difference Result 929 states and 2714 transitions. [2022-11-16 11:42:20,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:42:20,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-16 11:42:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:20,215 INFO L225 Difference]: With dead ends: 929 [2022-11-16 11:42:20,215 INFO L226 Difference]: Without dead ends: 416 [2022-11-16 11:42:20,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:42:20,216 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 54 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:20,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 10 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:42:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-11-16 11:42:20,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2022-11-16 11:42:20,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.76144578313253) internal successors, (1146), 415 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1146 transitions. [2022-11-16 11:42:20,227 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1146 transitions. Word has length 30 [2022-11-16 11:42:20,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:20,227 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 1146 transitions. [2022-11-16 11:42:20,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:20,227 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1146 transitions. [2022-11-16 11:42:20,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 11:42:20,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:20,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:20,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:42:20,229 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:42:20,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:20,230 INFO L85 PathProgramCache]: Analyzing trace with hash 148834020, now seen corresponding path program 2 times [2022-11-16 11:42:20,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:20,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968405987] [2022-11-16 11:42:20,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:20,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:22,685 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-16 11:42:22,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:22,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968405987] [2022-11-16 11:42:22,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968405987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:22,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:22,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:42:22,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853931884] [2022-11-16 11:42:22,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:22,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:42:22,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:22,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:42:22,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:42:22,688 INFO L87 Difference]: Start difference. First operand 416 states and 1146 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:23,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:23,896 INFO L93 Difference]: Finished difference Result 931 states and 2543 transitions. [2022-11-16 11:42:23,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:42:23,897 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-16 11:42:23,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:23,899 INFO L225 Difference]: With dead ends: 931 [2022-11-16 11:42:23,899 INFO L226 Difference]: Without dead ends: 823 [2022-11-16 11:42:23,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:42:23,900 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 85 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:23,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 26 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 11:42:23,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2022-11-16 11:42:23,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 476. [2022-11-16 11:42:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 2.694736842105263) internal successors, (1280), 475 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:23,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1280 transitions. [2022-11-16 11:42:23,918 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1280 transitions. Word has length 30 [2022-11-16 11:42:23,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:23,918 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 1280 transitions. [2022-11-16 11:42:23,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:23,919 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1280 transitions. [2022-11-16 11:42:23,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 11:42:23,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:23,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:23,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:42:23,921 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:42:23,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:23,922 INFO L85 PathProgramCache]: Analyzing trace with hash 640835896, now seen corresponding path program 3 times [2022-11-16 11:42:23,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:23,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631869928] [2022-11-16 11:42:23,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:23,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:27,122 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-16 11:42:27,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:27,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631869928] [2022-11-16 11:42:27,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631869928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:27,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:27,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:42:27,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393801300] [2022-11-16 11:42:27,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:27,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:42:27,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:27,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:42:27,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:42:27,124 INFO L87 Difference]: Start difference. First operand 476 states and 1280 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:27,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:27,865 INFO L93 Difference]: Finished difference Result 639 states and 1734 transitions. [2022-11-16 11:42:27,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:42:27,868 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-16 11:42:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:27,869 INFO L225 Difference]: With dead ends: 639 [2022-11-16 11:42:27,869 INFO L226 Difference]: Without dead ends: 492 [2022-11-16 11:42:27,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:42:27,871 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 111 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:27,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 31 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:42:27,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-11-16 11:42:27,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 334. [2022-11-16 11:42:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.720720720720721) internal successors, (906), 333 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 906 transitions. [2022-11-16 11:42:27,882 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 906 transitions. Word has length 30 [2022-11-16 11:42:27,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:27,883 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 906 transitions. [2022-11-16 11:42:27,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 906 transitions. [2022-11-16 11:42:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 11:42:27,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:27,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:27,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:42:27,885 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:42:27,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:27,886 INFO L85 PathProgramCache]: Analyzing trace with hash -483715690, now seen corresponding path program 4 times [2022-11-16 11:42:27,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:27,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111471426] [2022-11-16 11:42:27,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:27,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:42:28,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:42:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:42:28,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:42:28,269 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:42:28,270 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (17 of 18 remaining) [2022-11-16 11:42:28,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (16 of 18 remaining) [2022-11-16 11:42:28,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (15 of 18 remaining) [2022-11-16 11:42:28,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 18 remaining) [2022-11-16 11:42:28,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2022-11-16 11:42:28,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2022-11-16 11:42:28,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2022-11-16 11:42:28,274 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2022-11-16 11:42:28,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 18 remaining) [2022-11-16 11:42:28,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 18 remaining) [2022-11-16 11:42:28,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2022-11-16 11:42:28,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (6 of 18 remaining) [2022-11-16 11:42:28,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 18 remaining) [2022-11-16 11:42:28,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 18 remaining) [2022-11-16 11:42:28,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 18 remaining) [2022-11-16 11:42:28,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 18 remaining) [2022-11-16 11:42:28,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 18 remaining) [2022-11-16 11:42:28,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 18 remaining) [2022-11-16 11:42:28,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:42:28,280 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:28,287 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:42:28,287 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:42:28,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:42:28 BasicIcfg [2022-11-16 11:42:28,501 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:42:28,502 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:42:28,502 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:42:28,502 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:42:28,503 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:41:51" (3/4) ... [2022-11-16 11:42:28,506 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:42:28,508 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:42:28,509 INFO L158 Benchmark]: Toolchain (without parser) took 40295.52ms. Allocated memory was 127.9MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 85.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 200.0MB. Max. memory is 16.1GB. [2022-11-16 11:42:28,510 INFO L158 Benchmark]: CDTParser took 1.08ms. Allocated memory is still 127.9MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:42:28,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1061.11ms. Allocated memory is still 127.9MB. Free memory was 85.3MB in the beginning and 86.0MB in the end (delta: -622.9kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:42:28,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 135.50ms. Allocated memory is still 127.9MB. Free memory was 86.0MB in the beginning and 82.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 11:42:28,512 INFO L158 Benchmark]: Boogie Preprocessor took 46.65ms. Allocated memory is still 127.9MB. Free memory was 82.4MB in the beginning and 79.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:42:28,512 INFO L158 Benchmark]: RCFGBuilder took 1659.72ms. Allocated memory is still 127.9MB. Free memory was 79.7MB in the beginning and 65.3MB in the end (delta: 14.5MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2022-11-16 11:42:28,513 INFO L158 Benchmark]: TraceAbstraction took 37374.85ms. Allocated memory was 127.9MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 64.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-16 11:42:28,513 INFO L158 Benchmark]: Witness Printer took 7.04ms. Allocated memory is still 1.4GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:42:28,516 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.08ms. Allocated memory is still 127.9MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1061.11ms. Allocated memory is still 127.9MB. Free memory was 85.3MB in the beginning and 86.0MB in the end (delta: -622.9kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 135.50ms. Allocated memory is still 127.9MB. Free memory was 86.0MB in the beginning and 82.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.65ms. Allocated memory is still 127.9MB. Free memory was 82.4MB in the beginning and 79.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1659.72ms. Allocated memory is still 127.9MB. Free memory was 79.7MB in the beginning and 65.3MB in the end (delta: 14.5MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * TraceAbstraction took 37374.85ms. Allocated memory was 127.9MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 64.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 7.04ms. Allocated memory is still 1.4GB. Free memory is still 1.2GB. 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: 11.8s, 182 PlacesBefore, 59 PlacesAfterwards, 171 TransitionsBefore, 47 TransitionsAfterwards, 4044 CoEnabledTransitionPairs, 7 FixpointIterations, 78 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 166 TotalNumberOfCompositions, 12030 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5762, independent: 5512, independent conditional: 0, independent unconditional: 5512, dependent: 250, dependent conditional: 0, dependent unconditional: 250, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2785, independent: 2729, independent conditional: 0, independent unconditional: 2729, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2785, independent: 2678, independent conditional: 0, independent unconditional: 2678, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 107, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 967, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 877, dependent conditional: 0, dependent unconditional: 877, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5762, independent: 2783, independent conditional: 0, independent unconditional: 2783, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 2785, unknown conditional: 0, unknown unconditional: 2785] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 376, Positive conditional cache size: 0, Positive unconditional cache size: 376, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L727] 0 _Bool x$flush_delayed; [L740] 0 int *x$read_delayed_var; [L761] 0 int y$w_buff0; [L763] 0 int y$w_buff1; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff0_thd1; [L748] 0 int y$mem_tmp; [L731] 0 _Bool x$r_buff0_thd2; [L729] 0 _Bool x$r_buff0_thd0; [L759] 0 _Bool y$read_delayed; [L739] 0 _Bool x$read_delayed; [L710] 0 int __unbuffered_cnt = 0; [L764] 0 _Bool y$w_buff1_used; [L744] 0 _Bool x$w_buff1_used; [L741] 0 int x$w_buff0; [L743] 0 int x$w_buff1; [L760] 0 int *y$read_delayed_var; [L767] 0 _Bool weak$$choice0; [L768] 0 _Bool weak$$choice2; [L728] 0 int x$mem_tmp; [L751] 0 _Bool y$r_buff0_thd2; [L752] 0 _Bool y$r_buff0_thd3; [L753] 0 _Bool y$r_buff0_thd4; [L712] 0 int __unbuffered_p1_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L749] 0 _Bool y$r_buff0_thd0; [L750] 0 _Bool y$r_buff0_thd1; [L722] 0 int a = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L747] 0 _Bool y$flush_delayed; [L724] 0 _Bool main$tmp_guard1; [L723] 0 _Bool main$tmp_guard0; [L714] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L742] 0 _Bool x$w_buff0_used; [L762] 0 _Bool y$w_buff0_used; [L726] 0 int x = 0; [L735] 0 _Bool x$r_buff1_thd1; [L754] 0 _Bool y$r_buff1_thd0; [L734] 0 _Bool x$r_buff1_thd0; [L746] 0 int y = 0; [L756] 0 _Bool y$r_buff1_thd2; [L766] 0 int z = 0; [L755] 0 _Bool y$r_buff1_thd1; [L758] 0 _Bool y$r_buff1_thd4; [L738] 0 _Bool x$r_buff1_thd4; [L757] 0 _Bool y$r_buff1_thd3; [L737] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd2; [L922] 0 pthread_t t377; [L923] FCALL, FORK 0 pthread_create(&t377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t377, ((void *)0), P0, ((void *)0))=8, t377={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L924] 0 pthread_t t378; [L925] FCALL, FORK 0 pthread_create(&t378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t378, ((void *)0), P1, ((void *)0))=9, t377={5:0}, t378={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L926] 0 pthread_t t379; [L927] FCALL, FORK 0 pthread_create(&t379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t379, ((void *)0), P2, ((void *)0))=10, t377={5:0}, t378={6:0}, t379={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L928] 0 pthread_t t380; [L929] FCALL, FORK 0 pthread_create(&t380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t380, ((void *)0), P3, ((void *)0))=11, t377={5:0}, t378={6:0}, t379={7:0}, t380={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L792] 2 x$w_buff1 = x$w_buff0 [L793] 2 x$w_buff0 = 2 [L794] 2 x$w_buff1_used = x$w_buff0_used [L795] 2 x$w_buff0_used = (_Bool)1 [L796] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L796] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L797] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L798] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L799] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L800] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L801] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L802] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L805] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 2 x$flush_delayed = weak$$choice2 [L808] 2 x$mem_tmp = x [L809] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L810] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L811] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L812] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L813] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L815] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L816] 2 __unbuffered_p1_EAX = x [L817] 2 x = x$flush_delayed ? x$mem_tmp : x [L818] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L821] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 2 y$flush_delayed = weak$$choice2 [L824] 2 y$mem_tmp = y [L825] 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) [L826] 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)) [L827] 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)) [L828] 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)) [L829] 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)) [L830] 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)) [L831] 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)) [L832] 2 __unbuffered_p1_EBX = y [L833] 2 y = y$flush_delayed ? y$mem_tmp : y [L834] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L851] 3 y$w_buff1 = y$w_buff0 [L852] 3 y$w_buff0 = 1 [L853] 3 y$w_buff1_used = y$w_buff0_used [L854] 3 y$w_buff0_used = (_Bool)1 [L855] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L855] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L856] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L857] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L858] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L859] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L860] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L861] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L864] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L867] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L868] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L869] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L870] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L871] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L872] 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) [L873] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L874] 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 [L875] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L876] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=0] [L879] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L881] 3 return 0; [L886] 4 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L889] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L892] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L772] 1 a = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L775] 1 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L778] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L779] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L780] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L781] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L782] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L837] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L838] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L839] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L840] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L841] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L844] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 2 return 0; [L895] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L896] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L897] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L898] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L899] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L900] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L901] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L902] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L903] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L904] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L907] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L909] 4 return 0; [L931] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L933] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L933] RET 0 assume_abort_if_not(main$tmp_guard0) [L935] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L936] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L937] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L938] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L939] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L940] 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) [L941] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L942] 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 [L943] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L944] 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=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t377={5:0}, t378={6:0}, t379={7:0}, t380={3:0}, weak$$choice0=4, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L947] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L948] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L949] 0 x$flush_delayed = weak$$choice2 [L950] 0 x$mem_tmp = x [L951] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L952] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L953] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L954] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L955] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L957] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L958] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L959] 0 x = x$flush_delayed ? x$mem_tmp : x [L960] 0 x$flush_delayed = (_Bool)0 [L962] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 920]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 927]: 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: 929]: 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: 925]: 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: 923]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 210 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 36.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 762 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 762 mSDsluCounter, 233 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1654 IncrementalHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 79 mSDtfsCounter, 1654 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9224occurred in iteration=0, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 1111 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 3581 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-16 11:42:28,558 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix014_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8 --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 4fc83f7400faec1e297c0070148ef6e08fc24a46b81d9a9e52a0ee501a0da326 --- 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-e04fb08 [2022-11-16 11:42:31,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:42:31,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:42:31,517 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:42:31,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:42:31,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:42:31,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:42:31,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:42:31,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:42:31,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:42:31,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:42:31,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:42:31,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:42:31,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:42:31,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:42:31,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:42:31,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:42:31,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:42:31,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:42:31,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:42:31,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:42:31,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:42:31,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:42:31,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:42:31,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:42:31,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:42:31,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:42:31,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:42:31,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:42:31,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:42:31,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:42:31,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:42:31,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:42:31,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:42:31,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:42:31,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:42:31,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:42:31,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:42:31,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:42:31,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:42:31,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:42:31,623 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-16 11:42:31,691 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:42:31,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:42:31,693 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:42:31,694 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:42:31,695 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:42:31,696 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:42:31,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:42:31,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:42:31,699 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:42:31,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:42:31,700 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:42:31,701 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:42:31,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:42:31,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:42:31,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:42:31,702 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:42:31,703 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:42:31,703 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:42:31,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:42:31,704 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:42:31,704 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 11:42:31,704 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 11:42:31,704 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:42:31,705 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:42:31,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:42:31,705 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:42:31,706 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:42:31,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:42:31,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:42:31,707 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:42:31,707 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 11:42:31,708 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 11:42:31,708 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 11:42:31,709 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_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8 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 -> 4fc83f7400faec1e297c0070148ef6e08fc24a46b81d9a9e52a0ee501a0da326 [2022-11-16 11:42:32,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:42:32,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:42:32,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:42:32,233 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:42:32,237 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:42:32,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix014_tso.oepc.i [2022-11-16 11:42:32,316 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/data/f97cc5427/3ca6163384da4700b43544a38b662ec6/FLAG1eacae15a [2022-11-16 11:42:33,069 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:42:33,070 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/sv-benchmarks/c/pthread-wmm/mix014_tso.oepc.i [2022-11-16 11:42:33,093 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/data/f97cc5427/3ca6163384da4700b43544a38b662ec6/FLAG1eacae15a [2022-11-16 11:42:33,214 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/data/f97cc5427/3ca6163384da4700b43544a38b662ec6 [2022-11-16 11:42:33,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:42:33,218 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:42:33,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:42:33,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:42:33,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:42:33,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:42:33" (1/1) ... [2022-11-16 11:42:33,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50136a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:33, skipping insertion in model container [2022-11-16 11:42:33,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:42:33" (1/1) ... [2022-11-16 11:42:33,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:42:33,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:42:33,519 WARN L229 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_773f707b-d8fe-4fb6-9569-4933838ffb37/sv-benchmarks/c/pthread-wmm/mix014_tso.oepc.i[949,962] [2022-11-16 11:42:33,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:42:33,918 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:42:33,943 WARN L229 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_773f707b-d8fe-4fb6-9569-4933838ffb37/sv-benchmarks/c/pthread-wmm/mix014_tso.oepc.i[949,962] [2022-11-16 11:42:34,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:42:34,125 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:42:34,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:34 WrapperNode [2022-11-16 11:42:34,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:42:34,127 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:42:34,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:42:34,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:42:34,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:34" (1/1) ... [2022-11-16 11:42:34,159 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:34" (1/1) ... [2022-11-16 11:42:34,200 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 258 [2022-11-16 11:42:34,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:42:34,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:42:34,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:42:34,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:42:34,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:34" (1/1) ... [2022-11-16 11:42:34,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:34" (1/1) ... [2022-11-16 11:42:34,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:34" (1/1) ... [2022-11-16 11:42:34,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:34" (1/1) ... [2022-11-16 11:42:34,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:34" (1/1) ... [2022-11-16 11:42:34,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:34" (1/1) ... [2022-11-16 11:42:34,297 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:34" (1/1) ... [2022-11-16 11:42:34,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:34" (1/1) ... [2022-11-16 11:42:34,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:42:34,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:42:34,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:42:34,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:42:34,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:34" (1/1) ... [2022-11-16 11:42:34,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:42:34,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:42:34,397 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:42:34,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:42:34,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:42:34,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:42:34,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:42:34,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:42:34,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 11:42:34,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 11:42:34,457 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:42:34,457 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:42:34,458 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:42:34,459 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:42:34,459 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:42:34,459 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:42:34,459 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-16 11:42:34,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-16 11:42:34,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:42:34,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:42:34,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:42:34,462 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:42:34,765 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:42:34,768 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:42:35,653 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:42:36,079 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:42:36,079 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:42:36,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:42:36 BoogieIcfgContainer [2022-11-16 11:42:36,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:42:36,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:42:36,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:42:36,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:42:36,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:42:33" (1/3) ... [2022-11-16 11:42:36,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ccffe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:42:36, skipping insertion in model container [2022-11-16 11:42:36,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:34" (2/3) ... [2022-11-16 11:42:36,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ccffe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:42:36, skipping insertion in model container [2022-11-16 11:42:36,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:42:36" (3/3) ... [2022-11-16 11:42:36,102 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014_tso.oepc.i [2022-11-16 11:42:36,131 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:42:36,131 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-16 11:42:36,132 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:42:36,271 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:42:36,332 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:42:36,349 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 172 transitions, 364 flow [2022-11-16 11:42:36,354 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 172 transitions, 364 flow [2022-11-16 11:42:36,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 172 transitions, 364 flow [2022-11-16 11:42:36,505 INFO L130 PetriNetUnfolder]: 2/168 cut-off events. [2022-11-16 11:42:36,505 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:42:36,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 168 events. 2/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 103. Up to 2 conditions per place. [2022-11-16 11:42:36,521 INFO L119 LiptonReduction]: Number of co-enabled transitions 4044 [2022-11-16 11:42:56,719 INFO L134 LiptonReduction]: Checked pairs total: 12224 [2022-11-16 11:42:56,719 INFO L136 LiptonReduction]: Total number of compositions: 164 [2022-11-16 11:42:56,731 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 47 transitions, 114 flow [2022-11-16 11:42:57,386 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9224 states, 9197 states have (on average 4.207893878438622) internal successors, (38700), 9223 states have internal predecessors, (38700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:57,410 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:42:57,418 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;@7ca0aa1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:42:57,418 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-11-16 11:42:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 9224 states, 9197 states have (on average 4.207893878438622) internal successors, (38700), 9223 states have internal predecessors, (38700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:57,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 11:42:57,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:57,468 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 11:42:57,469 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:42:57,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:57,477 INFO L85 PathProgramCache]: Analyzing trace with hash 829, now seen corresponding path program 1 times [2022-11-16 11:42:57,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:42:57,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244546025] [2022-11-16 11:42:57,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:57,495 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-16 11:42:57,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:42:57,503 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:42:57,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:42:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:57,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 11:42:57,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:42:57,701 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-16 11:42:57,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:42:57,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:42:57,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244546025] [2022-11-16 11:42:57,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244546025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:57,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:57,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 11:42:57,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683556226] [2022-11-16 11:42:57,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:57,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:42:57,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:42:57,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:42:57,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:42:57,791 INFO L87 Difference]: Start difference. First operand has 9224 states, 9197 states have (on average 4.207893878438622) internal successors, (38700), 9223 states have internal predecessors, (38700), 0 states have call successors, (0), 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-16 11:42:58,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:58,432 INFO L93 Difference]: Finished difference Result 8722 states and 35768 transitions. [2022-11-16 11:42:58,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:42:58,436 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-16 11:42:58,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:58,655 INFO L225 Difference]: With dead ends: 8722 [2022-11-16 11:42:58,655 INFO L226 Difference]: Without dead ends: 8722 [2022-11-16 11:42:58,658 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-16 11:42:58,667 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:58,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:42:58,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8722 states. [2022-11-16 11:42:59,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8722 to 8722. [2022-11-16 11:42:59,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8722 states, 8711 states have (on average 4.106072781540581) internal successors, (35768), 8721 states have internal predecessors, (35768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8722 states to 8722 states and 35768 transitions. [2022-11-16 11:42:59,697 INFO L78 Accepts]: Start accepts. Automaton has 8722 states and 35768 transitions. Word has length 1 [2022-11-16 11:42:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:59,698 INFO L495 AbstractCegarLoop]: Abstraction has 8722 states and 35768 transitions. [2022-11-16 11:42:59,699 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-16 11:42:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 8722 states and 35768 transitions. [2022-11-16 11:42:59,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:42:59,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:59,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:42:59,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:42:59,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:42:59,916 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:42:59,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:59,917 INFO L85 PathProgramCache]: Analyzing trace with hash 784381768, now seen corresponding path program 1 times [2022-11-16 11:42:59,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:42:59,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322186339] [2022-11-16 11:42:59,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:59,919 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-16 11:42:59,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:42:59,921 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:00,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:00,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:43:00,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:00,193 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-16 11:43:00,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:00,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:00,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322186339] [2022-11-16 11:43:00,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322186339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:00,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:00,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:43:00,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707478925] [2022-11-16 11:43:00,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:00,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:43:00,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:00,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:43:00,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:43:00,202 INFO L87 Difference]: Start difference. First operand 8722 states and 35768 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:00,823 INFO L93 Difference]: Finished difference Result 7392 states and 30074 transitions. [2022-11-16 11:43:00,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:00,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-16 11:43:00,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:01,027 INFO L225 Difference]: With dead ends: 7392 [2022-11-16 11:43:01,028 INFO L226 Difference]: Without dead ends: 7272 [2022-11-16 11:43:01,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-16 11:43:01,030 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:01,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 8 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:43:01,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2022-11-16 11:43:01,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 7272. [2022-11-16 11:43:01,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7272 states, 7267 states have (on average 4.0784367689555525) internal successors, (29638), 7271 states have internal predecessors, (29638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7272 states to 7272 states and 29638 transitions. [2022-11-16 11:43:01,824 INFO L78 Accepts]: Start accepts. Automaton has 7272 states and 29638 transitions. Word has length 5 [2022-11-16 11:43:01,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:01,828 INFO L495 AbstractCegarLoop]: Abstraction has 7272 states and 29638 transitions. [2022-11-16 11:43:01,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:01,829 INFO L276 IsEmpty]: Start isEmpty. Operand 7272 states and 29638 transitions. [2022-11-16 11:43:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:43:01,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:01,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:01,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:02,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:02,048 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:43:02,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:02,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2123278537, now seen corresponding path program 1 times [2022-11-16 11:43:02,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:02,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501096129] [2022-11-16 11:43:02,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:02,052 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-16 11:43:02,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:02,055 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:02,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:02,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:43:02,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:02,283 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-16 11:43:02,285 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:02,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:02,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501096129] [2022-11-16 11:43:02,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501096129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:02,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:02,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:43:02,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250264273] [2022-11-16 11:43:02,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:02,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:43:02,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:02,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:43:02,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:43:02,291 INFO L87 Difference]: Start difference. First operand 7272 states and 29638 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-16 11:43:02,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:02,720 INFO L93 Difference]: Finished difference Result 5952 states and 23972 transitions. [2022-11-16 11:43:02,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:43:02,722 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-16 11:43:02,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:02,766 INFO L225 Difference]: With dead ends: 5952 [2022-11-16 11:43:02,767 INFO L226 Difference]: Without dead ends: 5772 [2022-11-16 11:43:02,767 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-16 11:43:02,768 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:02,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 8 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:43:02,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5772 states. [2022-11-16 11:43:03,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5772 to 5772. [2022-11-16 11:43:03,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5772 states, 5770 states have (on average 4.046447140381282) internal successors, (23348), 5771 states have internal predecessors, (23348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5772 states to 5772 states and 23348 transitions. [2022-11-16 11:43:03,225 INFO L78 Accepts]: Start accepts. Automaton has 5772 states and 23348 transitions. Word has length 7 [2022-11-16 11:43:03,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:03,227 INFO L495 AbstractCegarLoop]: Abstraction has 5772 states and 23348 transitions. [2022-11-16 11:43:03,227 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-16 11:43:03,227 INFO L276 IsEmpty]: Start isEmpty. Operand 5772 states and 23348 transitions. [2022-11-16 11:43:03,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:43:03,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:03,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:03,247 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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)] Ended with exit code 0 [2022-11-16 11:43:03,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:03,446 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:43:03,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:03,447 INFO L85 PathProgramCache]: Analyzing trace with hash 871926664, now seen corresponding path program 1 times [2022-11-16 11:43:03,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:03,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046075614] [2022-11-16 11:43:03,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:03,449 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-16 11:43:03,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:03,454 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:03,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:03,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:43:03,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:43:03,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:03,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:03,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046075614] [2022-11-16 11:43:03,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046075614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:03,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:03,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:43:03,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895497108] [2022-11-16 11:43:03,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:03,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:43:03,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:03,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:43:03,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:43:03,729 INFO L87 Difference]: Start difference. First operand 5772 states and 23348 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-16 11:43:04,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:04,118 INFO L93 Difference]: Finished difference Result 4672 states and 16688 transitions. [2022-11-16 11:43:04,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:43:04,120 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-16 11:43:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:04,247 INFO L225 Difference]: With dead ends: 4672 [2022-11-16 11:43:04,263 INFO L226 Difference]: Without dead ends: 3772 [2022-11-16 11:43:04,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:43:04,271 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 51 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:04,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 20 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:43:04,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3772 states. [2022-11-16 11:43:04,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3772 to 3772. [2022-11-16 11:43:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3772 states, 3770 states have (on average 3.5405835543766577) internal successors, (13348), 3771 states have internal predecessors, (13348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3772 states to 3772 states and 13348 transitions. [2022-11-16 11:43:04,504 INFO L78 Accepts]: Start accepts. Automaton has 3772 states and 13348 transitions. Word has length 11 [2022-11-16 11:43:04,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:04,511 INFO L495 AbstractCegarLoop]: Abstraction has 3772 states and 13348 transitions. [2022-11-16 11:43:04,511 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-16 11:43:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3772 states and 13348 transitions. [2022-11-16 11:43:04,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 11:43:04,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:04,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:04,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:04,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:04,737 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:43:04,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:04,738 INFO L85 PathProgramCache]: Analyzing trace with hash 629312812, now seen corresponding path program 1 times [2022-11-16 11:43:04,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:04,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107030986] [2022-11-16 11:43:04,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:04,739 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-16 11:43:04,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:04,741 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:04,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:04,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:43:04,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:05,045 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-16 11:43:05,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:05,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:05,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107030986] [2022-11-16 11:43:05,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107030986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:05,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:05,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:43:05,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718633470] [2022-11-16 11:43:05,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:05,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:43:05,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:05,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:43:05,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:43:05,051 INFO L87 Difference]: Start difference. First operand 3772 states and 13348 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:05,563 INFO L93 Difference]: Finished difference Result 2472 states and 7848 transitions. [2022-11-16 11:43:05,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:43:05,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 11:43:05,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:05,575 INFO L225 Difference]: With dead ends: 2472 [2022-11-16 11:43:05,576 INFO L226 Difference]: Without dead ends: 1972 [2022-11-16 11:43:05,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:43:05,577 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 68 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:05,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 36 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:43:05,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2022-11-16 11:43:05,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1972. [2022-11-16 11:43:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1972 states, 1970 states have (on average 3.120812182741117) internal successors, (6148), 1971 states have internal predecessors, (6148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 6148 transitions. [2022-11-16 11:43:05,657 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 6148 transitions. Word has length 15 [2022-11-16 11:43:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:05,658 INFO L495 AbstractCegarLoop]: Abstraction has 1972 states and 6148 transitions. [2022-11-16 11:43:05,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:05,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 6148 transitions. [2022-11-16 11:43:05,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 11:43:05,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:05,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:05,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:05,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:05,882 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:43:05,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:05,883 INFO L85 PathProgramCache]: Analyzing trace with hash 111214183, now seen corresponding path program 1 times [2022-11-16 11:43:05,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:05,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061662357] [2022-11-16 11:43:05,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:05,884 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-16 11:43:05,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:05,886 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:05,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:06,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:43:06,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:43:06,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:06,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:06,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061662357] [2022-11-16 11:43:06,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061662357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:06,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:06,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:43:06,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662218817] [2022-11-16 11:43:06,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:06,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:43:06,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:06,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:43:06,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:43:06,233 INFO L87 Difference]: Start difference. First operand 1972 states and 6148 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:06,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:06,939 INFO L93 Difference]: Finished difference Result 1507 states and 4714 transitions. [2022-11-16 11:43:06,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:43:06,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-16 11:43:06,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:06,949 INFO L225 Difference]: With dead ends: 1507 [2022-11-16 11:43:06,949 INFO L226 Difference]: Without dead ends: 1367 [2022-11-16 11:43:06,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:43:06,950 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 83 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:06,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 64 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 11:43:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2022-11-16 11:43:06,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1367. [2022-11-16 11:43:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1365 states have (on average 3.174358974358974) internal successors, (4333), 1366 states have internal predecessors, (4333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 4333 transitions. [2022-11-16 11:43:07,004 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 4333 transitions. Word has length 19 [2022-11-16 11:43:07,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:07,005 INFO L495 AbstractCegarLoop]: Abstraction has 1367 states and 4333 transitions. [2022-11-16 11:43:07,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:07,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 4333 transitions. [2022-11-16 11:43:07,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 11:43:07,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:07,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:07,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:07,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:07,224 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:43:07,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:07,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1028303561, now seen corresponding path program 1 times [2022-11-16 11:43:07,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:07,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642517572] [2022-11-16 11:43:07,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:07,225 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-16 11:43:07,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:07,232 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:07,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:07,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 11:43:07,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:07,593 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-16 11:43:07,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:07,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:07,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642517572] [2022-11-16 11:43:07,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642517572] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:07,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:07,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:43:07,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860053493] [2022-11-16 11:43:07,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:07,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:43:07,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:07,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:43:07,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:43:07,597 INFO L87 Difference]: Start difference. First operand 1367 states and 4333 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:08,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:08,389 INFO L93 Difference]: Finished difference Result 1296 states and 4189 transitions. [2022-11-16 11:43:08,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:43:08,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-16 11:43:08,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:08,397 INFO L225 Difference]: With dead ends: 1296 [2022-11-16 11:43:08,397 INFO L226 Difference]: Without dead ends: 1277 [2022-11-16 11:43:08,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:43:08,398 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 77 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:08,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 96 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 11:43:08,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2022-11-16 11:43:08,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1277. [2022-11-16 11:43:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 1275 states have (on average 3.2572549019607844) internal successors, (4153), 1276 states have internal predecessors, (4153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:08,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 4153 transitions. [2022-11-16 11:43:08,449 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 4153 transitions. Word has length 24 [2022-11-16 11:43:08,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:08,449 INFO L495 AbstractCegarLoop]: Abstraction has 1277 states and 4153 transitions. [2022-11-16 11:43:08,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:08,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 4153 transitions. [2022-11-16 11:43:08,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 11:43:08,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:08,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:08,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:08,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:08,684 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:43:08,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:08,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1664567245, now seen corresponding path program 1 times [2022-11-16 11:43:08,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:08,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056140907] [2022-11-16 11:43:08,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:08,686 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-16 11:43:08,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:08,687 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:08,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:43:08,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:43:08,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:09,027 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-16 11:43:09,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:09,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:09,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056140907] [2022-11-16 11:43:09,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056140907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:09,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:09,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:43:09,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297464033] [2022-11-16 11:43:09,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:09,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:43:09,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:09,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:43:09,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:43:09,033 INFO L87 Difference]: Start difference. First operand 1277 states and 4153 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:09,370 INFO L93 Difference]: Finished difference Result 1641 states and 5255 transitions. [2022-11-16 11:43:09,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:43:09,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-16 11:43:09,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:09,380 INFO L225 Difference]: With dead ends: 1641 [2022-11-16 11:43:09,381 INFO L226 Difference]: Without dead ends: 1641 [2022-11-16 11:43:09,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-16 11:43:09,382 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 39 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:09,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 15 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:43:09,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2022-11-16 11:43:09,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1639. [2022-11-16 11:43:09,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1637 states have (on average 3.209529627367135) internal successors, (5254), 1638 states have internal predecessors, (5254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 5254 transitions. [2022-11-16 11:43:09,465 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 5254 transitions. Word has length 29 [2022-11-16 11:43:09,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:09,466 INFO L495 AbstractCegarLoop]: Abstraction has 1639 states and 5254 transitions. [2022-11-16 11:43:09,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:09,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 5254 transitions. [2022-11-16 11:43:09,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 11:43:09,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:09,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:09,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:09,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:09,692 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:43:09,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:09,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1030513053, now seen corresponding path program 2 times [2022-11-16 11:43:09,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:09,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775891742] [2022-11-16 11:43:09,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:43:09,694 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-16 11:43:09,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:09,696 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:09,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:09,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 11:43:09,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:43:09,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 11:43:10,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:10,511 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-16 11:43:10,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:43:10,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:43:10,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775891742] [2022-11-16 11:43:10,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775891742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:43:10,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:43:10,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:43:10,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149179423] [2022-11-16 11:43:10,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:43:10,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:43:10,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:43:10,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:43:10,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:43:10,517 INFO L87 Difference]: Start difference. First operand 1639 states and 5254 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:11,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:11,096 INFO L93 Difference]: Finished difference Result 1957 states and 6129 transitions. [2022-11-16 11:43:11,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:43:11,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-16 11:43:11,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:11,109 INFO L225 Difference]: With dead ends: 1957 [2022-11-16 11:43:11,109 INFO L226 Difference]: Without dead ends: 1957 [2022-11-16 11:43:11,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:43:11,110 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 72 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:11,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 46 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:43:11,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2022-11-16 11:43:11,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1615. [2022-11-16 11:43:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1613 states have (on average 3.217606943583385) internal successors, (5190), 1614 states have internal predecessors, (5190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 5190 transitions. [2022-11-16 11:43:11,192 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 5190 transitions. Word has length 29 [2022-11-16 11:43:11,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:11,192 INFO L495 AbstractCegarLoop]: Abstraction has 1615 states and 5190 transitions. [2022-11-16 11:43:11,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:43:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 5190 transitions. [2022-11-16 11:43:11,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 11:43:11,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:11,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:11,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:11,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:11,425 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-16 11:43:11,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:11,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1792500953, now seen corresponding path program 3 times [2022-11-16 11:43:11,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:43:11,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374031459] [2022-11-16 11:43:11,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:43:11,427 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-16 11:43:11,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:43:11,429 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:11,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-16 11:43:11,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-16 11:43:11,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 11:43:11,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:43:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:43:12,063 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-16 11:43:12,064 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:43:12,065 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (17 of 18 remaining) [2022-11-16 11:43:12,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (16 of 18 remaining) [2022-11-16 11:43:12,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (15 of 18 remaining) [2022-11-16 11:43:12,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 18 remaining) [2022-11-16 11:43:12,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2022-11-16 11:43:12,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2022-11-16 11:43:12,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2022-11-16 11:43:12,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2022-11-16 11:43:12,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 18 remaining) [2022-11-16 11:43:12,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 18 remaining) [2022-11-16 11:43:12,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2022-11-16 11:43:12,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (6 of 18 remaining) [2022-11-16 11:43:12,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 18 remaining) [2022-11-16 11:43:12,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 18 remaining) [2022-11-16 11:43:12,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 18 remaining) [2022-11-16 11:43:12,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 18 remaining) [2022-11-16 11:43:12,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 18 remaining) [2022-11-16 11:43:12,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 18 remaining) [2022-11-16 11:43:12,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:43:12,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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-16 11:43:12,293 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:12,301 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:43:12,301 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:43:12,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:43:12 BasicIcfg [2022-11-16 11:43:12,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:43:12,568 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:43:12,568 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:43:12,568 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:43:12,569 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:42:36" (3/4) ... [2022-11-16 11:43:12,573 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:43:12,573 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:43:12,574 INFO L158 Benchmark]: Toolchain (without parser) took 39356.14ms. Allocated memory was 65.0MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 43.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 183.3MB. Max. memory is 16.1GB. [2022-11-16 11:43:12,574 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 65.0MB. Free memory was 46.1MB in the beginning and 46.1MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:43:12,575 INFO L158 Benchmark]: CACSL2BoogieTranslator took 906.85ms. Allocated memory is still 65.0MB. Free memory was 43.6MB in the beginning and 31.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 11:43:12,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.09ms. Allocated memory is still 65.0MB. Free memory was 31.6MB in the beginning and 27.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 11:43:12,576 INFO L158 Benchmark]: Boogie Preprocessor took 113.24ms. Allocated memory is still 65.0MB. Free memory was 27.8MB in the beginning and 46.4MB in the end (delta: -18.5MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2022-11-16 11:43:12,577 INFO L158 Benchmark]: RCFGBuilder took 1763.49ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 46.1MB in the beginning and 58.4MB in the end (delta: -12.3MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2022-11-16 11:43:12,577 INFO L158 Benchmark]: TraceAbstraction took 36479.53ms. Allocated memory was 86.0MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 57.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 175.8MB. Max. memory is 16.1GB. [2022-11-16 11:43:12,578 INFO L158 Benchmark]: Witness Printer took 5.73ms. Allocated memory is still 1.3GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:43:12,580 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.44ms. Allocated memory is still 65.0MB. Free memory was 46.1MB in the beginning and 46.1MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 906.85ms. Allocated memory is still 65.0MB. Free memory was 43.6MB in the beginning and 31.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.09ms. Allocated memory is still 65.0MB. Free memory was 31.6MB in the beginning and 27.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.24ms. Allocated memory is still 65.0MB. Free memory was 27.8MB in the beginning and 46.4MB in the end (delta: -18.5MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1763.49ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 46.1MB in the beginning and 58.4MB in the end (delta: -12.3MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * TraceAbstraction took 36479.53ms. Allocated memory was 86.0MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 57.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 175.8MB. Max. memory is 16.1GB. * Witness Printer took 5.73ms. Allocated memory is still 1.3GB. Free memory is still 1.1GB. 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: 20.4s, 183 PlacesBefore, 59 PlacesAfterwards, 172 TransitionsBefore, 47 TransitionsAfterwards, 4044 CoEnabledTransitionPairs, 7 FixpointIterations, 73 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 164 TotalNumberOfCompositions, 12224 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5290, independent: 5030, independent conditional: 0, independent unconditional: 5030, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2751, independent: 2662, independent conditional: 0, independent unconditional: 2662, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2751, independent: 2618, independent conditional: 0, independent unconditional: 2618, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 133, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1260, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 1157, dependent conditional: 0, dependent unconditional: 1157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5290, independent: 2368, independent conditional: 0, independent unconditional: 2368, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 2751, unknown conditional: 0, unknown unconditional: 2751] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 275, Positive conditional cache size: 0, Positive unconditional cache size: 275, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, 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: [L727] 0 _Bool x$flush_delayed; [L740] 0 int *x$read_delayed_var; [L761] 0 int y$w_buff0; [L763] 0 int y$w_buff1; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff0_thd1; [L748] 0 int y$mem_tmp; [L731] 0 _Bool x$r_buff0_thd2; [L729] 0 _Bool x$r_buff0_thd0; [L759] 0 _Bool y$read_delayed; [L739] 0 _Bool x$read_delayed; [L710] 0 int __unbuffered_cnt = 0; [L764] 0 _Bool y$w_buff1_used; [L744] 0 _Bool x$w_buff1_used; [L741] 0 int x$w_buff0; [L743] 0 int x$w_buff1; [L760] 0 int *y$read_delayed_var; [L767] 0 _Bool weak$$choice0; [L768] 0 _Bool weak$$choice2; [L728] 0 int x$mem_tmp; [L751] 0 _Bool y$r_buff0_thd2; [L752] 0 _Bool y$r_buff0_thd3; [L753] 0 _Bool y$r_buff0_thd4; [L712] 0 int __unbuffered_p1_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L749] 0 _Bool y$r_buff0_thd0; [L750] 0 _Bool y$r_buff0_thd1; [L722] 0 int a = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L747] 0 _Bool y$flush_delayed; [L724] 0 _Bool main$tmp_guard1; [L723] 0 _Bool main$tmp_guard0; [L714] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L742] 0 _Bool x$w_buff0_used; [L762] 0 _Bool y$w_buff0_used; [L726] 0 int x = 0; [L735] 0 _Bool x$r_buff1_thd1; [L754] 0 _Bool y$r_buff1_thd0; [L734] 0 _Bool x$r_buff1_thd0; [L746] 0 int y = 0; [L756] 0 _Bool y$r_buff1_thd2; [L766] 0 int z = 0; [L755] 0 _Bool y$r_buff1_thd1; [L758] 0 _Bool y$r_buff1_thd4; [L738] 0 _Bool x$r_buff1_thd4; [L757] 0 _Bool y$r_buff1_thd3; [L737] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd2; [L922] 0 pthread_t t377; [L923] FCALL, FORK 0 pthread_create(&t377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t377, ((void *)0), P0, ((void *)0))=0, t377={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L924] 0 pthread_t t378; [L925] FCALL, FORK 0 pthread_create(&t378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t378, ((void *)0), P1, ((void *)0))=1, t377={3:0}, t378={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L792] 2 x$w_buff1 = x$w_buff0 [L793] 2 x$w_buff0 = 2 [L794] 2 x$w_buff1_used = x$w_buff0_used [L795] 2 x$w_buff0_used = (_Bool)1 [L796] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L796] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L797] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L798] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L799] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L800] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L801] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L802] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L926] 0 pthread_t t379; [L927] FCALL, FORK 0 pthread_create(&t379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t379, ((void *)0), P2, ((void *)0))=2, t377={3:0}, t378={7:0}, t379={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L851] 3 y$w_buff1 = y$w_buff0 [L852] 3 y$w_buff0 = 1 [L853] 3 y$w_buff1_used = y$w_buff0_used [L854] 3 y$w_buff0_used = (_Bool)1 [L855] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L855] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L856] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L857] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L858] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L859] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L860] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L861] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L928] 0 pthread_t t380; [L864] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L929] FCALL, FORK 0 pthread_create(&t380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t380, ((void *)0), P3, ((void *)0))=3, t377={3:0}, t378={7:0}, t379={11:0}, t380={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L886] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L889] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L892] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L895] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L896] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L897] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L898] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L899] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L900] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L901] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L902] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L903] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L904] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L907] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L909] 4 return 0; [L772] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L775] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L778] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L779] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L780] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L781] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L782] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L805] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 2 x$flush_delayed = weak$$choice2 [L808] 2 x$mem_tmp = x [L809] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L810] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L811] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L812] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L813] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L815] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L816] 2 __unbuffered_p1_EAX = x [L817] 2 x = x$flush_delayed ? x$mem_tmp : x [L818] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 2 y$flush_delayed = weak$$choice2 [L824] 2 y$mem_tmp = y [L825] 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) [L826] 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)) [L827] 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)) [L828] 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)) [L829] 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)) [L830] 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)) [L831] 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)) [L832] 2 __unbuffered_p1_EBX = y [L833] 2 y = y$flush_delayed ? y$mem_tmp : y [L834] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L837] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L838] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L839] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L840] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L841] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L867] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L868] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L869] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L870] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L871] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L872] 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) [L873] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L874] 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 [L875] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L876] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L879] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L881] 3 return 0; [L844] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 2 return 0; [L931] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L933] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L933] RET 0 assume_abort_if_not(main$tmp_guard0) [L935] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L936] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L937] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L938] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L939] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L940] 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) [L941] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L942] 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 [L943] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L944] 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=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t377={3:0}, t378={7:0}, t379={11:0}, t380={15:0}, weak$$choice0=3, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L947] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L948] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L949] 0 x$flush_delayed = weak$$choice2 [L950] 0 x$mem_tmp = x [L951] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L952] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L953] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L954] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L955] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L957] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L958] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L959] 0 x = x$flush_delayed ? x$mem_tmp : x [L960] 0 x$flush_delayed = (_Bool)0 [L962] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 920]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 925]: 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: 923]: 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: 927]: 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: 929]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 211 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 36.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 21.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 427 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 427 mSDsluCounter, 297 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 208 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1587 IncrementalHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 89 mSDtfsCounter, 1587 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9224occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 344 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 610 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1605 ConjunctsInSsa, 57 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-16 11:43:12,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_773f707b-d8fe-4fb6-9569-4933838ffb37/bin/uautomizer-tPACEb0tL8/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