./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix006.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 557c1f2fab4f7585e181c0a50145e0f2efcca52cad7f093489c012afed407365 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 17:23:24,310 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:23:24,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:23:24,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:23:24,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:23:24,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:23:24,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:23:24,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:23:24,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:23:24,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:23:24,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:23:24,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:23:24,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:23:24,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:23:24,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:23:24,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:23:24,388 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:23:24,389 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:23:24,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:23:24,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:23:24,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:23:24,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:23:24,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:23:24,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:23:24,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:23:24,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:23:24,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:23:24,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:23:24,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:23:24,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:23:24,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:23:24,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:23:24,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:23:24,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:23:24,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:23:24,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:23:24,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:23:24,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:23:24,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:23:24,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:23:24,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:23:24,434 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 17:23:24,473 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:23:24,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:23:24,474 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:23:24,474 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:23:24,475 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 17:23:24,475 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 17:23:24,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:23:24,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:23:24,476 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:23:24,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:23:24,477 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 17:23:24,477 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 17:23:24,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:23:24,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 17:23:24,478 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:23:24,478 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 17:23:24,478 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 17:23:24,478 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 17:23:24,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 17:23:24,479 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 17:23:24,479 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 17:23:24,479 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:23:24,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:23:24,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:23:24,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 17:23:24,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:23:24,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:23:24,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 17:23:24,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:23:24,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 17:23:24,481 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_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 557c1f2fab4f7585e181c0a50145e0f2efcca52cad7f093489c012afed407365 [2022-11-21 17:23:24,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:23:24,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:23:24,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:23:24,843 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:23:24,844 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:23:24,845 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/mix006.opt.i [2022-11-21 17:23:28,038 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:23:28,404 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:23:28,404 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/sv-benchmarks/c/pthread-wmm/mix006.opt.i [2022-11-21 17:23:28,451 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/data/82804c918/99217be00cbe493b9fee5b39875517de/FLAG7d46fa7af [2022-11-21 17:23:28,466 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/data/82804c918/99217be00cbe493b9fee5b39875517de [2022-11-21 17:23:28,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:23:28,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:23:28,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:23:28,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:23:28,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:23:28,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:23:28" (1/1) ... [2022-11-21 17:23:28,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64cef969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:28, skipping insertion in model container [2022-11-21 17:23:28,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:23:28" (1/1) ... [2022-11-21 17:23:28,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:23:28,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:23:28,711 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/sv-benchmarks/c/pthread-wmm/mix006.opt.i[944,957] [2022-11-21 17:23:29,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:23:29,078 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:23:29,095 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/sv-benchmarks/c/pthread-wmm/mix006.opt.i[944,957] [2022-11-21 17:23:29,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:23:29,245 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:23:29,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:29 WrapperNode [2022-11-21 17:23:29,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:23:29,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:23:29,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:23:29,251 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:23:29,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:29" (1/1) ... [2022-11-21 17:23:29,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:29" (1/1) ... [2022-11-21 17:23:29,325 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 148 [2022-11-21 17:23:29,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:23:29,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:23:29,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:23:29,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:23:29,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:29" (1/1) ... [2022-11-21 17:23:29,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:29" (1/1) ... [2022-11-21 17:23:29,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:29" (1/1) ... [2022-11-21 17:23:29,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:29" (1/1) ... [2022-11-21 17:23:29,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:29" (1/1) ... [2022-11-21 17:23:29,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:29" (1/1) ... [2022-11-21 17:23:29,356 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:29" (1/1) ... [2022-11-21 17:23:29,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:29" (1/1) ... [2022-11-21 17:23:29,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:23:29,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:23:29,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:23:29,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:23:29,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:29" (1/1) ... [2022-11-21 17:23:29,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:23:29,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:23:29,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:23:29,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:23:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 17:23:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 17:23:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:23:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 17:23:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 17:23:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 17:23:29,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 17:23:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 17:23:29,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 17:23:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 17:23:29,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 17:23:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 17:23:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 17:23:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:23:29,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:23:29,464 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 17:23:29,682 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:23:29,684 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:23:30,184 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:23:30,443 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:23:30,447 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 17:23:30,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:23:30 BoogieIcfgContainer [2022-11-21 17:23:30,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:23:30,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:23:30,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:23:30,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:23:30,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:23:28" (1/3) ... [2022-11-21 17:23:30,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a55247a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:23:30, skipping insertion in model container [2022-11-21 17:23:30,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:29" (2/3) ... [2022-11-21 17:23:30,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a55247a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:23:30, skipping insertion in model container [2022-11-21 17:23:30,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:23:30" (3/3) ... [2022-11-21 17:23:30,464 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006.opt.i [2022-11-21 17:23:30,484 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:23:30,485 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-21 17:23:30,485 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 17:23:30,566 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 17:23:30,618 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 17:23:30,643 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 127 transitions, 269 flow [2022-11-21 17:23:30,649 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 127 transitions, 269 flow [2022-11-21 17:23:30,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 269 flow [2022-11-21 17:23:30,754 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-11-21 17:23:30,754 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 17:23:30,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-21 17:23:30,770 INFO L119 LiptonReduction]: Number of co-enabled transitions 2244 [2022-11-21 17:23:36,517 INFO L134 LiptonReduction]: Checked pairs total: 5991 [2022-11-21 17:23:36,517 INFO L136 LiptonReduction]: Total number of compositions: 119 [2022-11-21 17:23:36,526 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-21 17:23:36,610 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 980 states, 969 states have (on average 3.3230134158926727) internal successors, (3220), 979 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:36,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:23:36,636 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;@69228ce0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:23:36,636 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-21 17:23:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 980 states, 969 states have (on average 3.3230134158926727) internal successors, (3220), 979 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:36,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 17:23:36,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:23:36,647 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 17:23:36,648 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:23:36,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:36,653 INFO L85 PathProgramCache]: Analyzing trace with hash 553, now seen corresponding path program 1 times [2022-11-21 17:23:36,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:36,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048859217] [2022-11-21 17:23:36,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:36,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:36,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:36,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048859217] [2022-11-21 17:23:36,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048859217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:23:36,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:23:36,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 17:23:36,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344247047] [2022-11-21 17:23:36,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:23:36,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 17:23:36,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:36,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 17:23:36,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 17:23:36,862 INFO L87 Difference]: Start difference. First operand has 980 states, 969 states have (on average 3.3230134158926727) internal successors, (3220), 979 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:36,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:23:36,966 INFO L93 Difference]: Finished difference Result 930 states and 2962 transitions. [2022-11-21 17:23:36,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 17:23:36,969 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-21 17:23:36,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:23:36,991 INFO L225 Difference]: With dead ends: 930 [2022-11-21 17:23:36,991 INFO L226 Difference]: Without dead ends: 930 [2022-11-21 17:23:36,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 17:23:36,995 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:23:36,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:23:37,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2022-11-21 17:23:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2022-11-21 17:23:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 925 states have (on average 3.2021621621621623) internal successors, (2962), 929 states have internal predecessors, (2962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 2962 transitions. [2022-11-21 17:23:37,097 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 2962 transitions. Word has length 1 [2022-11-21 17:23:37,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:23:37,098 INFO L495 AbstractCegarLoop]: Abstraction has 930 states and 2962 transitions. [2022-11-21 17:23:37,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:37,098 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 2962 transitions. [2022-11-21 17:23:37,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-21 17:23:37,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:23:37,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:23:37,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 17:23:37,100 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:23:37,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:37,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1236783284, now seen corresponding path program 1 times [2022-11-21 17:23:37,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:37,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205395423] [2022-11-21 17:23:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:37,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:37,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:37,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205395423] [2022-11-21 17:23:37,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205395423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:23:37,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:23:37,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 17:23:37,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312942980] [2022-11-21 17:23:37,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:23:37,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:23:37,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:37,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:23:37,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:23:37,494 INFO L87 Difference]: Start difference. First operand 930 states and 2962 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:37,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:23:37,577 INFO L93 Difference]: Finished difference Result 790 states and 2485 transitions. [2022-11-21 17:23:37,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:23:37,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-21 17:23:37,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:23:37,583 INFO L225 Difference]: With dead ends: 790 [2022-11-21 17:23:37,583 INFO L226 Difference]: Without dead ends: 770 [2022-11-21 17:23:37,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:23:37,585 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:23:37,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:23:37,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-11-21 17:23:37,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2022-11-21 17:23:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 768 states have (on average 3.1692708333333335) internal successors, (2434), 769 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 2434 transitions. [2022-11-21 17:23:37,620 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 2434 transitions. Word has length 7 [2022-11-21 17:23:37,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:23:37,622 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 2434 transitions. [2022-11-21 17:23:37,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 2434 transitions. [2022-11-21 17:23:37,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 17:23:37,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:23:37,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:23:37,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 17:23:37,626 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:23:37,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:37,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1511760143, now seen corresponding path program 1 times [2022-11-21 17:23:37,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:37,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755499051] [2022-11-21 17:23:37,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:37,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:38,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:38,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:38,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755499051] [2022-11-21 17:23:38,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755499051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:23:38,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:23:38,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:23:38,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656242073] [2022-11-21 17:23:38,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:23:38,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:23:38,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:38,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:23:38,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:23:38,225 INFO L87 Difference]: Start difference. First operand 770 states and 2434 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:23:38,430 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2022-11-21 17:23:38,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:23:38,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 17:23:38,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:23:38,435 INFO L225 Difference]: With dead ends: 650 [2022-11-21 17:23:38,435 INFO L226 Difference]: Without dead ends: 650 [2022-11-21 17:23:38,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:23:38,436 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 38 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:23:38,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 24 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:23:38,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-11-21 17:23:38,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2022-11-21 17:23:38,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 649 states have (on average 3.1248073959938365) internal successors, (2028), 649 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2022-11-21 17:23:38,463 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 10 [2022-11-21 17:23:38,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:23:38,464 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2022-11-21 17:23:38,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2022-11-21 17:23:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 17:23:38,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:23:38,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:23:38,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 17:23:38,468 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:23:38,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:38,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1511760200, now seen corresponding path program 1 times [2022-11-21 17:23:38,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:38,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892164164] [2022-11-21 17:23:38,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:38,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:38,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:38,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892164164] [2022-11-21 17:23:38,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892164164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:23:38,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:23:38,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:23:38,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657348134] [2022-11-21 17:23:38,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:23:38,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:23:38,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:38,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:23:38,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:23:38,717 INFO L87 Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:23:38,919 INFO L93 Difference]: Finished difference Result 1106 states and 3230 transitions. [2022-11-21 17:23:38,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:23:38,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 17:23:38,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:23:38,926 INFO L225 Difference]: With dead ends: 1106 [2022-11-21 17:23:38,926 INFO L226 Difference]: Without dead ends: 894 [2022-11-21 17:23:38,926 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-21 17:23:38,927 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:23:38,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 12 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:23:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2022-11-21 17:23:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 782. [2022-11-21 17:23:38,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 3.032010243277849) internal successors, (2368), 781 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 2368 transitions. [2022-11-21 17:23:38,960 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 2368 transitions. Word has length 10 [2022-11-21 17:23:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:23:38,961 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 2368 transitions. [2022-11-21 17:23:38,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:38,961 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 2368 transitions. [2022-11-21 17:23:38,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 17:23:38,970 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:23:38,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:23:38,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 17:23:38,970 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:23:38,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:38,971 INFO L85 PathProgramCache]: Analyzing trace with hash 380042402, now seen corresponding path program 1 times [2022-11-21 17:23:38,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:38,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501267008] [2022-11-21 17:23:38,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:38,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:39,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:39,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501267008] [2022-11-21 17:23:39,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501267008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:23:39,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:23:39,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:23:39,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163113314] [2022-11-21 17:23:39,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:23:39,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:23:39,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:39,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:23:39,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:23:39,208 INFO L87 Difference]: Start difference. First operand 782 states and 2368 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:39,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:23:39,422 INFO L93 Difference]: Finished difference Result 922 states and 2640 transitions. [2022-11-21 17:23:39,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:23:39,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-21 17:23:39,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:23:39,428 INFO L225 Difference]: With dead ends: 922 [2022-11-21 17:23:39,429 INFO L226 Difference]: Without dead ends: 774 [2022-11-21 17:23:39,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:23:39,430 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 56 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:23:39,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 11 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:23:39,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-11-21 17:23:39,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 638. [2022-11-21 17:23:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 637 states have (on average 2.976452119309262) internal successors, (1896), 637 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:39,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1896 transitions. [2022-11-21 17:23:39,456 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1896 transitions. Word has length 11 [2022-11-21 17:23:39,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:23:39,456 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 1896 transitions. [2022-11-21 17:23:39,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:39,457 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1896 transitions. [2022-11-21 17:23:39,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 17:23:39,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:23:39,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:23:39,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 17:23:39,459 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:23:39,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:39,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1103676740, now seen corresponding path program 1 times [2022-11-21 17:23:39,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:39,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991947670] [2022-11-21 17:23:39,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:39,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:39,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:39,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991947670] [2022-11-21 17:23:39,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991947670] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:23:39,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:23:39,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:23:39,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698608279] [2022-11-21 17:23:39,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:23:39,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:23:39,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:39,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:23:39,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:23:39,602 INFO L87 Difference]: Start difference. First operand 638 states and 1896 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-21 17:23:39,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:23:39,721 INFO L93 Difference]: Finished difference Result 662 states and 1918 transitions. [2022-11-21 17:23:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:23:39,722 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-21 17:23:39,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:23:39,726 INFO L225 Difference]: With dead ends: 662 [2022-11-21 17:23:39,726 INFO L226 Difference]: Without dead ends: 590 [2022-11-21 17:23:39,726 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-21 17:23:39,727 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:23:39,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:23:39,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-11-21 17:23:39,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 542. [2022-11-21 17:23:39,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 2.9648798521256934) internal successors, (1604), 541 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:39,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1604 transitions. [2022-11-21 17:23:39,753 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1604 transitions. Word has length 12 [2022-11-21 17:23:39,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:23:39,753 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 1604 transitions. [2022-11-21 17:23:39,753 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-21 17:23:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1604 transitions. [2022-11-21 17:23:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 17:23:39,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:23:39,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:23:39,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 17:23:39,756 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:23:39,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:39,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1558586855, now seen corresponding path program 1 times [2022-11-21 17:23:39,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:39,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936304108] [2022-11-21 17:23:39,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:39,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:39,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:39,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936304108] [2022-11-21 17:23:39,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936304108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:23:39,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:23:39,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:23:39,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466321661] [2022-11-21 17:23:39,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:23:39,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:23:39,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:39,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:23:39,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:23:39,994 INFO L87 Difference]: Start difference. First operand 542 states and 1604 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:40,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:23:40,106 INFO L93 Difference]: Finished difference Result 510 states and 1322 transitions. [2022-11-21 17:23:40,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:23:40,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 17:23:40,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:23:40,109 INFO L225 Difference]: With dead ends: 510 [2022-11-21 17:23:40,109 INFO L226 Difference]: Without dead ends: 378 [2022-11-21 17:23:40,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:23:40,110 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 39 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:23:40,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 9 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:23:40,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-11-21 17:23:40,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2022-11-21 17:23:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 2.5251989389920424) internal successors, (952), 377 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 952 transitions. [2022-11-21 17:23:40,122 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 952 transitions. Word has length 14 [2022-11-21 17:23:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:23:40,123 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 952 transitions. [2022-11-21 17:23:40,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 952 transitions. [2022-11-21 17:23:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 17:23:40,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:23:40,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:23:40,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 17:23:40,125 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:23:40,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:40,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1243040796, now seen corresponding path program 1 times [2022-11-21 17:23:40,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:40,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869170515] [2022-11-21 17:23:40,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:40,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:40,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:40,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869170515] [2022-11-21 17:23:40,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869170515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:23:40,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:23:40,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:23:40,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212005665] [2022-11-21 17:23:40,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:23:40,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:23:40,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:40,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:23:40,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:23:40,444 INFO L87 Difference]: Start difference. First operand 378 states and 952 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:40,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:23:40,578 INFO L93 Difference]: Finished difference Result 298 states and 683 transitions. [2022-11-21 17:23:40,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:23:40,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 17:23:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:23:40,580 INFO L225 Difference]: With dead ends: 298 [2022-11-21 17:23:40,580 INFO L226 Difference]: Without dead ends: 230 [2022-11-21 17:23:40,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:23:40,581 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 78 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:23:40,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 12 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:23:40,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-21 17:23:40,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2022-11-21 17:23:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 2.2422907488986783) internal successors, (509), 227 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 509 transitions. [2022-11-21 17:23:40,590 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 509 transitions. Word has length 16 [2022-11-21 17:23:40,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:23:40,590 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 509 transitions. [2022-11-21 17:23:40,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:40,591 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 509 transitions. [2022-11-21 17:23:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 17:23:40,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:23:40,592 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-21 17:23:40,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 17:23:40,592 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:23:40,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:40,593 INFO L85 PathProgramCache]: Analyzing trace with hash 939951164, now seen corresponding path program 1 times [2022-11-21 17:23:40,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:40,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250273881] [2022-11-21 17:23:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:40,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:40,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:40,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250273881] [2022-11-21 17:23:40,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250273881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:23:40,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:23:40,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:23:40,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649984413] [2022-11-21 17:23:40,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:23:40,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:23:40,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:40,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:23:40,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:23:40,893 INFO L87 Difference]: Start difference. First operand 228 states and 509 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-21 17:23:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:23:41,028 INFO L93 Difference]: Finished difference Result 199 states and 450 transitions. [2022-11-21 17:23:41,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:23:41,029 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-21 17:23:41,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:23:41,030 INFO L225 Difference]: With dead ends: 199 [2022-11-21 17:23:41,030 INFO L226 Difference]: Without dead ends: 172 [2022-11-21 17:23:41,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:23:41,031 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 103 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:23:41,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 8 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:23:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-21 17:23:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2022-11-21 17:23:41,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.31055900621118) internal successors, (372), 161 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 372 transitions. [2022-11-21 17:23:41,041 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 372 transitions. Word has length 19 [2022-11-21 17:23:41,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:23:41,041 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 372 transitions. [2022-11-21 17:23:41,041 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-21 17:23:41,042 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 372 transitions. [2022-11-21 17:23:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 17:23:41,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:23:41,043 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-21 17:23:41,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 17:23:41,043 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:23:41,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:41,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2116258325, now seen corresponding path program 1 times [2022-11-21 17:23:41,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:41,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414806730] [2022-11-21 17:23:41,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:41,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:41,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:41,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:41,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414806730] [2022-11-21 17:23:41,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414806730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:23:41,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:23:41,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:23:41,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717885757] [2022-11-21 17:23:41,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:23:41,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:23:41,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:41,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:23:41,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:23:41,330 INFO L87 Difference]: Start difference. First operand 162 states and 372 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:41,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:23:41,455 INFO L93 Difference]: Finished difference Result 204 states and 455 transitions. [2022-11-21 17:23:41,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:23:41,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 17:23:41,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:23:41,456 INFO L225 Difference]: With dead ends: 204 [2022-11-21 17:23:41,456 INFO L226 Difference]: Without dead ends: 71 [2022-11-21 17:23:41,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:23:41,457 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 19 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:23:41,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 16 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:23:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-21 17:23:41,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-21 17:23:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.9142857142857144) internal successors, (134), 70 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 134 transitions. [2022-11-21 17:23:41,460 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 134 transitions. Word has length 22 [2022-11-21 17:23:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:23:41,460 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 134 transitions. [2022-11-21 17:23:41,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:41,461 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 134 transitions. [2022-11-21 17:23:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 17:23:41,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:23:41,461 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-21 17:23:41,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 17:23:41,461 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:23:41,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:41,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1403168077, now seen corresponding path program 2 times [2022-11-21 17:23:41,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:41,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091778543] [2022-11-21 17:23:41,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:41,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:23:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:23:42,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:23:42,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091778543] [2022-11-21 17:23:42,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091778543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:23:42,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:23:42,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:23:42,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916897975] [2022-11-21 17:23:42,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:23:42,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 17:23:42,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:23:42,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 17:23:42,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:23:42,789 INFO L87 Difference]: Start difference. First operand 71 states and 134 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-21 17:23:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:23:43,057 INFO L93 Difference]: Finished difference Result 82 states and 149 transitions. [2022-11-21 17:23:43,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 17:23:43,058 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-21 17:23:43,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:23:43,059 INFO L225 Difference]: With dead ends: 82 [2022-11-21 17:23:43,059 INFO L226 Difference]: Without dead ends: 47 [2022-11-21 17:23:43,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-21 17:23:43,060 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 32 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:23:43,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 29 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:23:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-21 17:23:43,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-21 17:23:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.565217391304348) internal successors, (72), 46 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:23:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 72 transitions. [2022-11-21 17:23:43,062 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 72 transitions. Word has length 22 [2022-11-21 17:23:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:23:43,063 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 72 transitions. [2022-11-21 17:23:43,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-21 17:23:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 72 transitions. [2022-11-21 17:23:43,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 17:23:43,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:23:43,064 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-21 17:23:43,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 17:23:43,064 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:23:43,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:23:43,065 INFO L85 PathProgramCache]: Analyzing trace with hash -241468147, now seen corresponding path program 3 times [2022-11-21 17:23:43,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:23:43,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551622580] [2022-11-21 17:23:43,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:23:43,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:23:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:23:43,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:23:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:23:43,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:23:43,245 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 17:23:43,246 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-21 17:23:43,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-21 17:23:43,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-21 17:23:43,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-21 17:23:43,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-21 17:23:43,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-21 17:23:43,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-21 17:23:43,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-21 17:23:43,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-21 17:23:43,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-21 17:23:43,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-21 17:23:43,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-21 17:23:43,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-21 17:23:43,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 17:23:43,254 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:23:43,261 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 17:23:43,261 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 17:23:43,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 05:23:43 BasicIcfg [2022-11-21 17:23:43,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 17:23:43,342 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 17:23:43,342 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 17:23:43,342 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 17:23:43,343 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:23:30" (3/4) ... [2022-11-21 17:23:43,346 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 17:23:43,346 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 17:23:43,347 INFO L158 Benchmark]: Toolchain (without parser) took 14876.33ms. Allocated memory was 148.9MB in the beginning and 226.5MB in the end (delta: 77.6MB). Free memory was 106.0MB in the beginning and 157.4MB in the end (delta: -51.4MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2022-11-21 17:23:43,347 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 113.2MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:23:43,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 776.29ms. Allocated memory is still 148.9MB. Free memory was 106.0MB in the beginning and 82.2MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-21 17:23:43,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.44ms. Allocated memory is still 148.9MB. Free memory was 82.2MB in the beginning and 79.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:23:43,348 INFO L158 Benchmark]: Boogie Preprocessor took 36.32ms. Allocated memory is still 148.9MB. Free memory was 79.6MB in the beginning and 77.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:23:43,349 INFO L158 Benchmark]: RCFGBuilder took 1087.44ms. Allocated memory is still 148.9MB. Free memory was 77.5MB in the beginning and 118.1MB in the end (delta: -40.6MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2022-11-21 17:23:43,349 INFO L158 Benchmark]: TraceAbstraction took 12887.83ms. Allocated memory was 148.9MB in the beginning and 226.5MB in the end (delta: 77.6MB). Free memory was 117.9MB in the beginning and 158.5MB in the end (delta: -40.6MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2022-11-21 17:23:43,349 INFO L158 Benchmark]: Witness Printer took 4.58ms. Allocated memory is still 226.5MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:23:43,351 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.20ms. Allocated memory is still 113.2MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 776.29ms. Allocated memory is still 148.9MB. Free memory was 106.0MB in the beginning and 82.2MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.44ms. Allocated memory is still 148.9MB. Free memory was 82.2MB in the beginning and 79.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.32ms. Allocated memory is still 148.9MB. Free memory was 79.6MB in the beginning and 77.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1087.44ms. Allocated memory is still 148.9MB. Free memory was 77.5MB in the beginning and 118.1MB in the end (delta: -40.6MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12887.83ms. Allocated memory was 148.9MB in the beginning and 226.5MB in the end (delta: 77.6MB). Free memory was 117.9MB in the beginning and 158.5MB in the end (delta: -40.6MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * Witness Printer took 4.58ms. Allocated memory is still 226.5MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 135 PlacesBefore, 44 PlacesAfterwards, 127 TransitionsBefore, 35 TransitionsAfterwards, 2244 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 119 TotalNumberOfCompositions, 5991 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2969, independent: 2796, independent conditional: 0, independent unconditional: 2796, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1509, independent: 1467, independent conditional: 0, independent unconditional: 1467, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1509, independent: 1451, independent conditional: 0, independent unconditional: 1451, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 339, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 287, dependent conditional: 0, dependent unconditional: 287, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2969, independent: 1329, independent conditional: 0, independent unconditional: 1329, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 1509, unknown conditional: 0, unknown unconditional: 1509] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L846] 0 pthread_t t156; [L847] FCALL, FORK 0 pthread_create(&t156, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t156, ((void *)0), P0, ((void *)0))=-2, t156={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t157; [L849] FCALL, FORK 0 pthread_create(&t157, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t157, ((void *)0), P1, ((void *)0))=-1, t156={5:0}, t157={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t158; [L851] FCALL, FORK 0 pthread_create(&t158, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t158, ((void *)0), P2, ((void *)0))=0, t156={5:0}, t157={6:0}, t158={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L797] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L797] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 y$flush_delayed = weak$$choice2 [L808] 3 y$mem_tmp = y [L809] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EAX = y [L817] 3 y = y$flush_delayed ? y$mem_tmp : y [L818] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L821] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L747] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y [L772] 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) [L773] 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)) [L774] 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)) [L775] 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)) [L776] 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)) [L777] 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)) [L778] 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)) [L779] 2 __unbuffered_p1_EBX = y [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L824] 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) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 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=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 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 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t156={5:0}, t157={6:0}, t158={3:0}, weak$$choice0=50, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 154 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 424 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 424 mSDsluCounter, 143 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 847 IncrementalHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 51 mSDtfsCounter, 847 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=980occurred in iteration=0, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 308 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 1052 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-21 17:23:43,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 557c1f2fab4f7585e181c0a50145e0f2efcca52cad7f093489c012afed407365 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 17:23:46,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:23:46,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:23:46,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:23:46,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:23:46,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:23:46,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:23:46,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:23:46,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:23:46,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:23:46,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:23:46,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:23:46,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:23:46,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:23:46,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:23:46,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:23:46,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:23:46,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:23:46,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:23:46,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:23:46,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:23:46,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:23:46,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:23:46,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:23:46,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:23:46,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:23:46,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:23:46,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:23:46,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:23:46,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:23:46,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:23:46,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:23:46,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:23:46,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:23:46,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:23:46,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:23:46,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:23:46,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:23:46,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:23:46,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:23:46,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:23:46,320 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-21 17:23:46,366 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:23:46,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:23:46,368 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:23:46,368 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:23:46,369 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 17:23:46,369 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 17:23:46,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:23:46,370 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:23:46,371 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:23:46,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:23:46,372 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 17:23:46,373 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 17:23:46,373 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:23:46,373 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 17:23:46,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:23:46,373 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 17:23:46,374 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 17:23:46,374 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 17:23:46,374 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 17:23:46,374 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 17:23:46,375 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-21 17:23:46,375 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-21 17:23:46,375 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 17:23:46,375 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:23:46,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:23:46,376 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:23:46,376 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 17:23:46,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:23:46,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:23:46,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 17:23:46,377 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-21 17:23:46,377 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-21 17:23:46,378 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-21 17:23:46,378 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_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 557c1f2fab4f7585e181c0a50145e0f2efcca52cad7f093489c012afed407365 [2022-11-21 17:23:46,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:23:46,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:23:46,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:23:46,826 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:23:46,827 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:23:46,829 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/mix006.opt.i [2022-11-21 17:23:50,209 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:23:50,549 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:23:50,550 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/sv-benchmarks/c/pthread-wmm/mix006.opt.i [2022-11-21 17:23:50,565 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/data/0e5578284/70cc8cfebb824cfa9b84e79a24080a96/FLAGdbb9a8927 [2022-11-21 17:23:50,591 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/data/0e5578284/70cc8cfebb824cfa9b84e79a24080a96 [2022-11-21 17:23:50,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:23:50,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:23:50,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:23:50,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:23:50,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:23:50,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:23:50" (1/1) ... [2022-11-21 17:23:50,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ed0a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:50, skipping insertion in model container [2022-11-21 17:23:50,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:23:50" (1/1) ... [2022-11-21 17:23:50,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:23:50,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:23:50,857 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/sv-benchmarks/c/pthread-wmm/mix006.opt.i[944,957] [2022-11-21 17:23:51,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:23:51,230 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:23:51,246 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/sv-benchmarks/c/pthread-wmm/mix006.opt.i[944,957] [2022-11-21 17:23:51,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:23:51,399 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:23:51,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:51 WrapperNode [2022-11-21 17:23:51,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:23:51,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:23:51,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:23:51,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:23:51,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:51" (1/1) ... [2022-11-21 17:23:51,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:51" (1/1) ... [2022-11-21 17:23:51,512 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2022-11-21 17:23:51,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:23:51,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:23:51,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:23:51,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:23:51,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:51" (1/1) ... [2022-11-21 17:23:51,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:51" (1/1) ... [2022-11-21 17:23:51,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:51" (1/1) ... [2022-11-21 17:23:51,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:51" (1/1) ... [2022-11-21 17:23:51,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:51" (1/1) ... [2022-11-21 17:23:51,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:51" (1/1) ... [2022-11-21 17:23:51,575 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:51" (1/1) ... [2022-11-21 17:23:51,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:51" (1/1) ... [2022-11-21 17:23:51,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:23:51,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:23:51,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:23:51,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:23:51,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:51" (1/1) ... [2022-11-21 17:23:51,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:23:51,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:23:51,641 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:23:51,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:23:51,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 17:23:51,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:23:51,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 17:23:51,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 17:23:51,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-21 17:23:51,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-21 17:23:51,698 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 17:23:51,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 17:23:51,699 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 17:23:51,699 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 17:23:51,699 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 17:23:51,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 17:23:51,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 17:23:51,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:23:51,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:23:51,702 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 17:23:51,923 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:23:51,925 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:23:52,397 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:23:52,581 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:23:52,581 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 17:23:52,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:23:52 BoogieIcfgContainer [2022-11-21 17:23:52,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:23:52,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:23:52,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:23:52,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:23:52,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:23:50" (1/3) ... [2022-11-21 17:23:52,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12fee695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:23:52, skipping insertion in model container [2022-11-21 17:23:52,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:23:51" (2/3) ... [2022-11-21 17:23:52,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12fee695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:23:52, skipping insertion in model container [2022-11-21 17:23:52,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:23:52" (3/3) ... [2022-11-21 17:23:52,595 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006.opt.i [2022-11-21 17:23:52,617 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:23:52,618 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-21 17:23:52,618 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 17:23:52,685 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 17:23:52,725 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 17:23:52,761 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 128 transitions, 271 flow [2022-11-21 17:23:52,771 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 128 transitions, 271 flow [2022-11-21 17:23:52,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 128 transitions, 271 flow [2022-11-21 17:23:52,866 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-11-21 17:23:52,866 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 17:23:52,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-21 17:23:52,878 INFO L119 LiptonReduction]: Number of co-enabled transitions 2244 [2022-11-21 17:24:01,845 INFO L134 LiptonReduction]: Checked pairs total: 5966 [2022-11-21 17:24:01,845 INFO L136 LiptonReduction]: Total number of compositions: 120 [2022-11-21 17:24:01,853 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-21 17:24:01,937 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 980 states, 969 states have (on average 3.3230134158926727) internal successors, (3220), 979 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:01,956 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:24:01,963 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;@38e62ad6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:24:01,963 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-21 17:24:01,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 980 states, 969 states have (on average 3.3230134158926727) internal successors, (3220), 979 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:01,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 17:24:01,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:24:01,973 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 17:24:01,974 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:24:01,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:24:01,979 INFO L85 PathProgramCache]: Analyzing trace with hash 555, now seen corresponding path program 1 times [2022-11-21 17:24:01,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:24:01,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125765440] [2022-11-21 17:24:01,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:24:01,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 17:24:01,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:24:02,003 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 17:24:02,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-21 17:24:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:24:02,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-21 17:24:02,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:24:02,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:24:02,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:24:02,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 17:24:02,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125765440] [2022-11-21 17:24:02,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125765440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:24:02,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:24:02,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 17:24:02,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201063950] [2022-11-21 17:24:02,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:24:02,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 17:24:02,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 17:24:02,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 17:24:02,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 17:24:02,187 INFO L87 Difference]: Start difference. First operand has 980 states, 969 states have (on average 3.3230134158926727) internal successors, (3220), 979 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:02,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:24:02,414 INFO L93 Difference]: Finished difference Result 930 states and 2962 transitions. [2022-11-21 17:24:02,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 17:24:02,428 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-21 17:24:02,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:24:02,473 INFO L225 Difference]: With dead ends: 930 [2022-11-21 17:24:02,474 INFO L226 Difference]: Without dead ends: 930 [2022-11-21 17:24:02,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 17:24:02,483 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:24:02,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:24:02,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2022-11-21 17:24:02,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2022-11-21 17:24:02,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 925 states have (on average 3.2021621621621623) internal successors, (2962), 929 states have internal predecessors, (2962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 2962 transitions. [2022-11-21 17:24:02,632 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 2962 transitions. Word has length 1 [2022-11-21 17:24:02,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:24:02,633 INFO L495 AbstractCegarLoop]: Abstraction has 930 states and 2962 transitions. [2022-11-21 17:24:02,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 2962 transitions. [2022-11-21 17:24:02,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-21 17:24:02,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:24:02,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:24:02,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-21 17:24:02,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 17:24:02,835 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:24:02,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:24:02,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1343089128, now seen corresponding path program 1 times [2022-11-21 17:24:02,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:24:02,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212112476] [2022-11-21 17:24:02,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:24:02,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 17:24:02,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:24:02,841 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 17:24:02,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-21 17:24:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:24:02,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 17:24:02,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:24:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:24:03,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:24:03,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 17:24:03,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212112476] [2022-11-21 17:24:03,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212112476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:24:03,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:24:03,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 17:24:03,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838426832] [2022-11-21 17:24:03,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:24:03,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:24:03,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 17:24:03,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:24:03,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:24:03,029 INFO L87 Difference]: Start difference. First operand 930 states and 2962 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:03,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:24:03,155 INFO L93 Difference]: Finished difference Result 790 states and 2485 transitions. [2022-11-21 17:24:03,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:24:03,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-21 17:24:03,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:24:03,166 INFO L225 Difference]: With dead ends: 790 [2022-11-21 17:24:03,166 INFO L226 Difference]: Without dead ends: 770 [2022-11-21 17:24:03,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:24:03,169 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:24:03,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:24:03,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-11-21 17:24:03,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2022-11-21 17:24:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 768 states have (on average 3.1692708333333335) internal successors, (2434), 769 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 2434 transitions. [2022-11-21 17:24:03,249 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 2434 transitions. Word has length 7 [2022-11-21 17:24:03,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:24:03,250 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 2434 transitions. [2022-11-21 17:24:03,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:03,250 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 2434 transitions. [2022-11-21 17:24:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 17:24:03,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:24:03,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:24:03,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-21 17:24:03,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 17:24:03,464 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:24:03,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:24:03,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2076593383, now seen corresponding path program 1 times [2022-11-21 17:24:03,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:24:03,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083305827] [2022-11-21 17:24:03,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:24:03,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 17:24:03,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:24:03,468 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 17:24:03,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-21 17:24:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:24:03,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 17:24:03,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:24:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:24:03,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:24:03,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 17:24:03,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083305827] [2022-11-21 17:24:03,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083305827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:24:03,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:24:03,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:24:03,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871995612] [2022-11-21 17:24:03,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:24:03,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:24:03,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 17:24:03,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:24:03,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:24:03,659 INFO L87 Difference]: Start difference. First operand 770 states and 2434 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:03,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:24:03,862 INFO L93 Difference]: Finished difference Result 590 states and 1580 transitions. [2022-11-21 17:24:03,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:24:03,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-21 17:24:03,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:24:03,868 INFO L225 Difference]: With dead ends: 590 [2022-11-21 17:24:03,868 INFO L226 Difference]: Without dead ends: 470 [2022-11-21 17:24:03,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:24:03,870 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:24:03,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 15 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:24:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-11-21 17:24:03,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2022-11-21 17:24:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 468 states have (on average 2.6367521367521367) internal successors, (1234), 469 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:03,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1234 transitions. [2022-11-21 17:24:03,891 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1234 transitions. Word has length 9 [2022-11-21 17:24:03,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:24:03,891 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 1234 transitions. [2022-11-21 17:24:03,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:03,892 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1234 transitions. [2022-11-21 17:24:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 17:24:03,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:24:03,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:24:03,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-21 17:24:04,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 17:24:04,109 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:24:04,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:24:04,111 INFO L85 PathProgramCache]: Analyzing trace with hash 998420890, now seen corresponding path program 1 times [2022-11-21 17:24:04,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:24:04,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051404132] [2022-11-21 17:24:04,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:24:04,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 17:24:04,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:24:04,113 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 17:24:04,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-21 17:24:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:24:04,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 17:24:04,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:24:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:24:04,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:24:04,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 17:24:04,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051404132] [2022-11-21 17:24:04,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051404132] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:24:04,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:24:04,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:24:04,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228288421] [2022-11-21 17:24:04,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:24:04,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:24:04,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 17:24:04,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:24:04,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:24:04,338 INFO L87 Difference]: Start difference. First operand 470 states and 1234 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-21 17:24:04,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:24:04,687 INFO L93 Difference]: Finished difference Result 295 states and 682 transitions. [2022-11-21 17:24:04,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:24:04,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-21 17:24:04,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:24:04,689 INFO L225 Difference]: With dead ends: 295 [2022-11-21 17:24:04,689 INFO L226 Difference]: Without dead ends: 235 [2022-11-21 17:24:04,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:24:04,691 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:24:04,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 27 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:24:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-11-21 17:24:04,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2022-11-21 17:24:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 233 states have (on average 2.2703862660944205) internal successors, (529), 234 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:04,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 529 transitions. [2022-11-21 17:24:04,702 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 529 transitions. Word has length 12 [2022-11-21 17:24:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:24:04,703 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 529 transitions. [2022-11-21 17:24:04,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-21 17:24:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 529 transitions. [2022-11-21 17:24:04,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 17:24:04,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:24:04,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:24:04,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-21 17:24:04,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 17:24:04,924 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:24:04,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:24:04,925 INFO L85 PathProgramCache]: Analyzing trace with hash 260538768, now seen corresponding path program 1 times [2022-11-21 17:24:04,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:24:04,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861670509] [2022-11-21 17:24:04,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:24:04,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 17:24:04,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:24:04,927 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 17:24:04,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-21 17:24:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:24:05,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 17:24:05,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:24:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:24:05,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:24:05,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 17:24:05,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861670509] [2022-11-21 17:24:05,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861670509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:24:05,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:24:05,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:24:05,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021570223] [2022-11-21 17:24:05,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:24:05,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:24:05,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 17:24:05,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:24:05,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:24:05,139 INFO L87 Difference]: Start difference. First operand 235 states and 529 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:24:05,461 INFO L93 Difference]: Finished difference Result 188 states and 433 transitions. [2022-11-21 17:24:05,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:24:05,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 17:24:05,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:24:05,463 INFO L225 Difference]: With dead ends: 188 [2022-11-21 17:24:05,463 INFO L226 Difference]: Without dead ends: 175 [2022-11-21 17:24:05,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:24:05,464 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:24:05,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 45 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:24:05,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-21 17:24:05,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-11-21 17:24:05,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 173 states have (on average 2.3641618497109826) internal successors, (409), 174 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 409 transitions. [2022-11-21 17:24:05,470 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 409 transitions. Word has length 16 [2022-11-21 17:24:05,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:24:05,470 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 409 transitions. [2022-11-21 17:24:05,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:05,471 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 409 transitions. [2022-11-21 17:24:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 17:24:05,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:24:05,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:24:05,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-21 17:24:05,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 17:24:05,692 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:24:05,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:24:05,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1498139382, now seen corresponding path program 1 times [2022-11-21 17:24:05,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:24:05,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731174537] [2022-11-21 17:24:05,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:24:05,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 17:24:05,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:24:05,694 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 17:24:05,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-21 17:24:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:24:05,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 17:24:05,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:24:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:24:05,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:24:05,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 17:24:05,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731174537] [2022-11-21 17:24:05,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731174537] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:24:05,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:24:05,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:24:05,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243799980] [2022-11-21 17:24:05,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:24:05,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:24:05,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 17:24:05,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:24:05,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:24:05,921 INFO L87 Difference]: Start difference. First operand 175 states and 409 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:06,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:24:06,078 INFO L93 Difference]: Finished difference Result 224 states and 509 transitions. [2022-11-21 17:24:06,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:24:06,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-21 17:24:06,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:24:06,080 INFO L225 Difference]: With dead ends: 224 [2022-11-21 17:24:06,080 INFO L226 Difference]: Without dead ends: 224 [2022-11-21 17:24:06,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:24:06,081 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:24:06,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:24:06,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-11-21 17:24:06,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2022-11-21 17:24:06,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 220 states have (on average 2.309090909090909) internal successors, (508), 221 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 508 transitions. [2022-11-21 17:24:06,091 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 508 transitions. Word has length 21 [2022-11-21 17:24:06,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:24:06,092 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 508 transitions. [2022-11-21 17:24:06,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:06,093 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 508 transitions. [2022-11-21 17:24:06,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 17:24:06,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:24:06,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:24:06,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-21 17:24:06,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 17:24:06,308 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:24:06,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:24:06,308 INFO L85 PathProgramCache]: Analyzing trace with hash -6437666, now seen corresponding path program 2 times [2022-11-21 17:24:06,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:24:06,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701257035] [2022-11-21 17:24:06,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:24:06,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 17:24:06,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:24:06,310 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 17:24:06,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-21 17:24:06,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 17:24:06,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:24:06,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 17:24:06,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:24:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:24:06,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:24:06,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 17:24:06,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701257035] [2022-11-21 17:24:06,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701257035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:24:06,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:24:06,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:24:06,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220838351] [2022-11-21 17:24:06,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:24:06,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:24:06,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 17:24:06,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:24:06,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:24:06,511 INFO L87 Difference]: Start difference. First operand 222 states and 508 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:06,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:24:06,622 INFO L93 Difference]: Finished difference Result 316 states and 697 transitions. [2022-11-21 17:24:06,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:24:06,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-21 17:24:06,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:24:06,624 INFO L225 Difference]: With dead ends: 316 [2022-11-21 17:24:06,624 INFO L226 Difference]: Without dead ends: 316 [2022-11-21 17:24:06,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:24:06,625 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:24:06,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:24:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-11-21 17:24:06,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 210. [2022-11-21 17:24:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 208 states have (on average 2.3028846153846154) internal successors, (479), 209 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:06,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 479 transitions. [2022-11-21 17:24:06,634 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 479 transitions. Word has length 21 [2022-11-21 17:24:06,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:24:06,634 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 479 transitions. [2022-11-21 17:24:06,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:24:06,635 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 479 transitions. [2022-11-21 17:24:06,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 17:24:06,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:24:06,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:24:06,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-21 17:24:06,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 17:24:06,850 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:24:06,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:24:06,850 INFO L85 PathProgramCache]: Analyzing trace with hash -784856310, now seen corresponding path program 3 times [2022-11-21 17:24:06,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:24:06,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948973126] [2022-11-21 17:24:06,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 17:24:06,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 17:24:06,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:24:06,854 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 17:24:06,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-21 17:24:07,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-21 17:24:07,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 17:24:07,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:24:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:24:07,188 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-21 17:24:07,188 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 17:24:07,189 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-21 17:24:07,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-21 17:24:07,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-21 17:24:07,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-21 17:24:07,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-21 17:24:07,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-21 17:24:07,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-21 17:24:07,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-21 17:24:07,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-21 17:24:07,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-21 17:24:07,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-21 17:24:07,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-21 17:24:07,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-21 17:24:07,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-21 17:24:07,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 17:24:07,419 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-11-21 17:24:07,425 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 17:24:07,425 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 17:24:07,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 05:24:07 BasicIcfg [2022-11-21 17:24:07,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 17:24:07,489 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 17:24:07,489 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 17:24:07,489 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 17:24:07,490 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:23:52" (3/4) ... [2022-11-21 17:24:07,493 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 17:24:07,493 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 17:24:07,493 INFO L158 Benchmark]: Toolchain (without parser) took 16898.33ms. Allocated memory was 69.2MB in the beginning and 134.2MB in the end (delta: 65.0MB). Free memory was 39.6MB in the beginning and 48.7MB in the end (delta: -9.1MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2022-11-21 17:24:07,494 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 69.2MB. Free memory is still 47.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:24:07,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 802.54ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 39.4MB in the beginning and 58.9MB in the end (delta: -19.6MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2022-11-21 17:24:07,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.86ms. Allocated memory is still 92.3MB. Free memory was 58.9MB in the beginning and 56.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:24:07,495 INFO L158 Benchmark]: Boogie Preprocessor took 81.20ms. Allocated memory is still 92.3MB. Free memory was 56.1MB in the beginning and 54.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:24:07,495 INFO L158 Benchmark]: RCFGBuilder took 989.26ms. Allocated memory is still 92.3MB. Free memory was 54.1MB in the beginning and 62.5MB in the end (delta: -8.5MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2022-11-21 17:24:07,495 INFO L158 Benchmark]: TraceAbstraction took 14901.53ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 61.4MB in the beginning and 48.7MB in the end (delta: 12.7MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. [2022-11-21 17:24:07,496 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 134.2MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:24:07,497 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 69.2MB. Free memory is still 47.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 802.54ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 39.4MB in the beginning and 58.9MB in the end (delta: -19.6MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.86ms. Allocated memory is still 92.3MB. Free memory was 58.9MB in the beginning and 56.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.20ms. Allocated memory is still 92.3MB. Free memory was 56.1MB in the beginning and 54.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 989.26ms. Allocated memory is still 92.3MB. Free memory was 54.1MB in the beginning and 62.5MB in the end (delta: -8.5MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14901.53ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 61.4MB in the beginning and 48.7MB in the end (delta: 12.7MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 134.2MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.1s, 136 PlacesBefore, 44 PlacesAfterwards, 128 TransitionsBefore, 35 TransitionsAfterwards, 2244 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 5966 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2893, independent: 2715, independent conditional: 0, independent unconditional: 2715, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1534, independent: 1481, independent conditional: 0, independent unconditional: 1481, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1534, independent: 1463, independent conditional: 0, independent unconditional: 1463, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 71, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 490, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 451, dependent conditional: 0, dependent unconditional: 451, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2893, independent: 1234, independent conditional: 0, independent unconditional: 1234, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 1534, unknown conditional: 0, unknown unconditional: 1534] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L846] 0 pthread_t t156; [L847] FCALL, FORK 0 pthread_create(&t156, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t156, ((void *)0), P0, ((void *)0))=0, t156={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t157; [L849] FCALL, FORK 0 pthread_create(&t157, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t157, ((void *)0), P1, ((void *)0))=1, t156={-6:0}, t157={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t158; [L851] FCALL, FORK 0 pthread_create(&t158, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t158, ((void *)0), P2, ((void *)0))=2, t156={-6:0}, t157={-10:0}, t158={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L797] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L797] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 y$flush_delayed = weak$$choice2 [L808] 3 y$mem_tmp = y [L809] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EAX = y [L817] 3 y = y$flush_delayed ? y$mem_tmp : y [L818] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L821] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L747] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y [L772] 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) [L773] 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)) [L774] 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)) [L775] 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)) [L776] 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)) [L777] 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)) [L778] 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)) [L779] 2 __unbuffered_p1_EBX = y [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L824] 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) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 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=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 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 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t156={-6:0}, t157={-10:0}, t158={-2:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 155 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 14.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 617 IncrementalHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 43 mSDtfsCounter, 617 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=980occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 108 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 202 SizeOfPredicates, 10 NumberOfNonLiveVariables, 802 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-21 17:24:07,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3372196-1287-49bb-8abf-9e1fc9f7e9a2/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample