./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:59:13,314 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:59:13,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:59:13,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:59:13,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:59:13,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:59:13,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:59:13,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:59:13,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:59:13,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:59:13,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:59:13,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:59:13,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:59:13,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:59:13,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:59:13,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:59:13,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:59:13,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:59:13,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:59:13,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:59:13,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:59:13,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:59:13,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:59:13,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:59:13,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:59:13,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:59:13,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:59:13,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:59:13,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:59:13,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:59:13,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:59:13,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:59:13,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:59:13,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:59:13,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:59:13,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:59:13,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:59:13,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:59:13,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:59:13,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:59:13,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:59:13,394 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 16:59:13,434 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:59:13,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:59:13,435 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:59:13,436 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:59:13,437 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:59:13,437 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:59:13,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:59:13,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:59:13,439 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:59:13,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:59:13,440 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:59:13,440 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:59:13,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:59:13,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:59:13,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:59:13,441 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 16:59:13,442 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 16:59:13,442 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 16:59:13,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:59:13,442 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:59:13,443 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:59:13,443 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:59:13,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:59:13,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:59:13,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:59:13,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:59:13,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:59:13,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:59:13,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:59:13,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:59:13,445 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_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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 -> 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 [2022-11-21 16:59:13,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:59:13,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:59:13,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:59:13,744 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:59:13,744 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:59:13,746 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 16:59:16,943 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:59:17,287 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:59:17,287 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 16:59:17,303 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/data/644f1ed15/48eec5a3ce254eca8530e53c7ffc544c/FLAG8bd2fa7f2 [2022-11-21 16:59:17,317 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/data/644f1ed15/48eec5a3ce254eca8530e53c7ffc544c [2022-11-21 16:59:17,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:59:17,321 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:59:17,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:59:17,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:59:17,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:59:17,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:59:17" (1/1) ... [2022-11-21 16:59:17,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a30b15d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:17, skipping insertion in model container [2022-11-21 16:59:17,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:59:17" (1/1) ... [2022-11-21 16:59:17,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:59:17,396 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:59:17,573 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_bb66bbc0-1a97-4b12-9366-be451c04ddd1/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-11-21 16:59:17,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:59:17,924 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:59:17,940 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_bb66bbc0-1a97-4b12-9366-be451c04ddd1/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-11-21 16:59:18,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:59:18,038 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:59:18,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:18 WrapperNode [2022-11-21 16:59:18,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:59:18,040 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:59:18,040 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:59:18,040 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:59:18,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:18" (1/1) ... [2022-11-21 16:59:18,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:18" (1/1) ... [2022-11-21 16:59:18,099 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-21 16:59:18,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:59:18,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:59:18,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:59:18,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:59:18,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:18" (1/1) ... [2022-11-21 16:59:18,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:18" (1/1) ... [2022-11-21 16:59:18,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:18" (1/1) ... [2022-11-21 16:59:18,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:18" (1/1) ... [2022-11-21 16:59:18,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:18" (1/1) ... [2022-11-21 16:59:18,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:18" (1/1) ... [2022-11-21 16:59:18,131 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:18" (1/1) ... [2022-11-21 16:59:18,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:18" (1/1) ... [2022-11-21 16:59:18,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:59:18,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:59:18,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:59:18,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:59:18,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:18" (1/1) ... [2022-11-21 16:59:18,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:59:18,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:59:18,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:59:18,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:59:18,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:59:18,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:59:18,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:59:18,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:59:18,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:59:18,219 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 16:59:18,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 16:59:18,219 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 16:59:18,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 16:59:18,220 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 16:59:18,220 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 16:59:18,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:59:18,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:59:18,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:59:18,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:59:18,222 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:59:18,381 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:59:18,384 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:59:18,921 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:59:19,169 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:59:19,169 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:59:19,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:59:19 BoogieIcfgContainer [2022-11-21 16:59:19,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:59:19,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:59:19,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:59:19,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:59:19,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:59:17" (1/3) ... [2022-11-21 16:59:19,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29902e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:59:19, skipping insertion in model container [2022-11-21 16:59:19,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:18" (2/3) ... [2022-11-21 16:59:19,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29902e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:59:19, skipping insertion in model container [2022-11-21 16:59:19,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:59:19" (3/3) ... [2022-11-21 16:59:19,185 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 16:59:19,206 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:59:19,206 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-21 16:59:19,206 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:59:19,285 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 16:59:19,334 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 16:59:19,348 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 263 flow [2022-11-21 16:59:19,351 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 263 flow [2022-11-21 16:59:19,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-11-21 16:59:19,450 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-11-21 16:59:19,454 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:59:19,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 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/110 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-21 16:59:19,465 INFO L119 LiptonReduction]: Number of co-enabled transitions 2320 [2022-11-21 16:59:25,965 INFO L134 LiptonReduction]: Checked pairs total: 6245 [2022-11-21 16:59:25,966 INFO L136 LiptonReduction]: Total number of compositions: 122 [2022-11-21 16:59:25,979 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-21 16:59:26,091 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:26,111 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:59:26,117 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;@70058d08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:59:26,117 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-21 16:59:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:26,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 16:59:26,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:26,128 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 16:59:26,129 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:26,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:26,134 INFO L85 PathProgramCache]: Analyzing trace with hash 597, now seen corresponding path program 1 times [2022-11-21 16:59:26,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:26,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515679656] [2022-11-21 16:59:26,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:26,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:26,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:26,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515679656] [2022-11-21 16:59:26,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515679656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:26,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:26,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 16:59:26,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592468280] [2022-11-21 16:59:26,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:26,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:59:26,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:26,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:59:26,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:59:26,329 INFO L87 Difference]: Start difference. First operand has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:26,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:26,457 INFO L93 Difference]: Finished difference Result 1024 states and 3277 transitions. [2022-11-21 16:59:26,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:59:26,460 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-21 16:59:26,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:26,483 INFO L225 Difference]: With dead ends: 1024 [2022-11-21 16:59:26,483 INFO L226 Difference]: Without dead ends: 1024 [2022-11-21 16:59:26,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:59:26,487 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:26,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:59:26,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2022-11-21 16:59:26,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2022-11-21 16:59:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1019 states have (on average 3.215897939156035) internal successors, (3277), 1023 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:26,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 3277 transitions. [2022-11-21 16:59:26,602 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 3277 transitions. Word has length 1 [2022-11-21 16:59:26,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:26,602 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 3277 transitions. [2022-11-21 16:59:26,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:26,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 3277 transitions. [2022-11-21 16:59:26,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 16:59:26,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:26,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 16:59:26,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:59:26,609 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:26,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:26,610 INFO L85 PathProgramCache]: Analyzing trace with hash 588868, now seen corresponding path program 1 times [2022-11-21 16:59:26,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:26,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066368232] [2022-11-21 16:59:26,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:26,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:26,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:26,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:26,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066368232] [2022-11-21 16:59:26,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066368232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:26,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:26,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:59:26,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047174325] [2022-11-21 16:59:26,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:26,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:59:26,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:26,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:59:26,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:59:26,961 INFO L87 Difference]: Start difference. First operand 1024 states and 3277 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:27,072 INFO L93 Difference]: Finished difference Result 837 states and 2640 transitions. [2022-11-21 16:59:27,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:59:27,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-21 16:59:27,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:27,079 INFO L225 Difference]: With dead ends: 837 [2022-11-21 16:59:27,079 INFO L226 Difference]: Without dead ends: 812 [2022-11-21 16:59:27,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:59:27,081 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:27,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:59:27,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-21 16:59:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2022-11-21 16:59:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 3.1790123456790123) internal successors, (2575), 811 states have internal predecessors, (2575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2022-11-21 16:59:27,154 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 3 [2022-11-21 16:59:27,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:27,155 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2022-11-21 16:59:27,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2022-11-21 16:59:27,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 16:59:27,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:27,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:27,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:59:27,158 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:27,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:27,158 INFO L85 PathProgramCache]: Analyzing trace with hash 258582709, now seen corresponding path program 1 times [2022-11-21 16:59:27,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:27,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504068701] [2022-11-21 16:59:27,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:27,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:27,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:27,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:27,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504068701] [2022-11-21 16:59:27,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504068701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:27,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:27,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:59:27,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223028065] [2022-11-21 16:59:27,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:27,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:59:27,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:27,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:59:27,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:59:27,926 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:28,139 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2022-11-21 16:59:28,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:59:28,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 16:59:28,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:28,145 INFO L225 Difference]: With dead ends: 687 [2022-11-21 16:59:28,146 INFO L226 Difference]: Without dead ends: 687 [2022-11-21 16:59:28,146 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 16:59:28,148 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 50 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 17 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 16:59:28,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 17 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:59:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2022-11-21 16:59:28,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2022-11-21 16:59:28,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 3.1341107871720117) internal successors, (2150), 686 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:28,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2022-11-21 16:59:28,181 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 10 [2022-11-21 16:59:28,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:28,183 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2022-11-21 16:59:28,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:28,183 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2022-11-21 16:59:28,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 16:59:28,187 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:28,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:28,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:59:28,188 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:28,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:28,190 INFO L85 PathProgramCache]: Analyzing trace with hash 258582647, now seen corresponding path program 1 times [2022-11-21 16:59:28,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:28,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108333478] [2022-11-21 16:59:28,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:28,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:28,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:28,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108333478] [2022-11-21 16:59:28,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108333478] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:28,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:28,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:59:28,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22252362] [2022-11-21 16:59:28,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:28,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:59:28,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:28,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:59:28,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:59:28,434 INFO L87 Difference]: Start difference. First operand 687 states and 2150 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 16:59:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:28,619 INFO L93 Difference]: Finished difference Result 792 states and 2384 transitions. [2022-11-21 16:59:28,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:59:28,620 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 16:59:28,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:28,625 INFO L225 Difference]: With dead ends: 792 [2022-11-21 16:59:28,626 INFO L226 Difference]: Without dead ends: 667 [2022-11-21 16:59:28,626 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 16:59:28,627 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:28,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:59:28,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-11-21 16:59:28,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2022-11-21 16:59:28,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 3.114114114114114) internal successors, (2074), 666 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2074 transitions. [2022-11-21 16:59:28,657 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 2074 transitions. Word has length 10 [2022-11-21 16:59:28,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:28,657 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 2074 transitions. [2022-11-21 16:59:28,657 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 16:59:28,658 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 2074 transitions. [2022-11-21 16:59:28,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 16:59:28,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:28,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:28,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:59:28,660 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:28,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:28,661 INFO L85 PathProgramCache]: Analyzing trace with hash -608908461, now seen corresponding path program 1 times [2022-11-21 16:59:28,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:28,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634865544] [2022-11-21 16:59:28,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:28,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:29,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:29,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:29,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634865544] [2022-11-21 16:59:29,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634865544] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:29,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:29,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:59:29,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747797214] [2022-11-21 16:59:29,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:29,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:59:29,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:29,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:59:29,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:59:29,601 INFO L87 Difference]: Start difference. First operand 667 states and 2074 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 16:59:30,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:30,052 INFO L93 Difference]: Finished difference Result 848 states and 2565 transitions. [2022-11-21 16:59:30,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:59:30,053 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 16:59:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:30,059 INFO L225 Difference]: With dead ends: 848 [2022-11-21 16:59:30,059 INFO L226 Difference]: Without dead ends: 713 [2022-11-21 16:59:30,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:59:30,061 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 48 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:30,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 10 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:59:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-11-21 16:59:30,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 641. [2022-11-21 16:59:30,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 3.0640625) internal successors, (1961), 640 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:30,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1961 transitions. [2022-11-21 16:59:30,091 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1961 transitions. Word has length 11 [2022-11-21 16:59:30,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:30,091 INFO L495 AbstractCegarLoop]: Abstraction has 641 states and 1961 transitions. [2022-11-21 16:59:30,092 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 16:59:30,092 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1961 transitions. [2022-11-21 16:59:30,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 16:59:30,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:30,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:30,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:59:30,099 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:30,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:30,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1786159002, now seen corresponding path program 1 times [2022-11-21 16:59:30,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:30,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189371002] [2022-11-21 16:59:30,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:30,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:30,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:30,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189371002] [2022-11-21 16:59:30,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189371002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:30,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:30,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:59:30,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675341071] [2022-11-21 16:59:30,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:30,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:59:30,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:30,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:59:30,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:59:30,998 INFO L87 Difference]: Start difference. First operand 641 states and 1961 transitions. Second operand has 5 states, 4 states have (on average 3.0) 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 16:59:31,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:31,321 INFO L93 Difference]: Finished difference Result 753 states and 2236 transitions. [2022-11-21 16:59:31,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:59:31,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) 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 16:59:31,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:31,326 INFO L225 Difference]: With dead ends: 753 [2022-11-21 16:59:31,326 INFO L226 Difference]: Without dead ends: 649 [2022-11-21 16:59:31,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:59:31,327 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 48 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:31,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 10 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:59:31,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2022-11-21 16:59:31,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 590. [2022-11-21 16:59:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 589 states have (on average 3.027164685908319) internal successors, (1783), 589 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:31,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 1783 transitions. [2022-11-21 16:59:31,351 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 1783 transitions. Word has length 12 [2022-11-21 16:59:31,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:31,351 INFO L495 AbstractCegarLoop]: Abstraction has 590 states and 1783 transitions. [2022-11-21 16:59:31,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) 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 16:59:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1783 transitions. [2022-11-21 16:59:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 16:59:31,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:31,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:31,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:59:31,354 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:31,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:31,354 INFO L85 PathProgramCache]: Analyzing trace with hash 356232992, now seen corresponding path program 1 times [2022-11-21 16:59:31,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:31,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83428409] [2022-11-21 16:59:31,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:31,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:32,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:32,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83428409] [2022-11-21 16:59:32,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83428409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:32,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:32,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:59:32,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637963207] [2022-11-21 16:59:32,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:32,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:59:32,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:32,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:59:32,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:59:32,827 INFO L87 Difference]: Start difference. First operand 590 states and 1783 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:33,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:33,095 INFO L93 Difference]: Finished difference Result 650 states and 1916 transitions. [2022-11-21 16:59:33,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:59:33,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-21 16:59:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:33,099 INFO L225 Difference]: With dead ends: 650 [2022-11-21 16:59:33,100 INFO L226 Difference]: Without dead ends: 588 [2022-11-21 16:59:33,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:59:33,101 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 46 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:33,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 8 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:59:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-11-21 16:59:33,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2022-11-21 16:59:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 587 states have (on average 3.0187393526405453) internal successors, (1772), 587 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1772 transitions. [2022-11-21 16:59:33,124 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1772 transitions. Word has length 13 [2022-11-21 16:59:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:33,125 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 1772 transitions. [2022-11-21 16:59:33,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1772 transitions. [2022-11-21 16:59:33,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:59:33,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:33,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:33,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:59:33,128 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:33,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:33,128 INFO L85 PathProgramCache]: Analyzing trace with hash 198211207, now seen corresponding path program 1 times [2022-11-21 16:59:33,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:33,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571942391] [2022-11-21 16:59:33,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:33,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:34,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:34,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571942391] [2022-11-21 16:59:34,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571942391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:34,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:34,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:59:34,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502417873] [2022-11-21 16:59:34,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:34,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:59:34,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:34,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:59:34,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:59:34,020 INFO L87 Difference]: Start difference. First operand 588 states and 1772 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:34,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:34,276 INFO L93 Difference]: Finished difference Result 927 states and 2691 transitions. [2022-11-21 16:59:34,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:59:34,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 16:59:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:34,300 INFO L225 Difference]: With dead ends: 927 [2022-11-21 16:59:34,301 INFO L226 Difference]: Without dead ends: 630 [2022-11-21 16:59:34,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:59:34,305 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 31 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:34,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 10 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:59:34,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-11-21 16:59:34,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 555. [2022-11-21 16:59:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 2.9007220216606497) internal successors, (1607), 554 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1607 transitions. [2022-11-21 16:59:34,327 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1607 transitions. Word has length 14 [2022-11-21 16:59:34,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:34,328 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 1607 transitions. [2022-11-21 16:59:34,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1607 transitions. [2022-11-21 16:59:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:59:34,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:34,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:34,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:59:34,330 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:34,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:34,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1387795341, now seen corresponding path program 1 times [2022-11-21 16:59:34,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:34,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646229334] [2022-11-21 16:59:34,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:34,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:35,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:35,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646229334] [2022-11-21 16:59:35,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646229334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:35,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:35,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:59:35,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97988658] [2022-11-21 16:59:35,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:35,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:59:35,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:35,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:59:35,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:59:35,544 INFO L87 Difference]: Start difference. First operand 555 states and 1607 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:36,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:36,265 INFO L93 Difference]: Finished difference Result 875 states and 2517 transitions. [2022-11-21 16:59:36,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:59:36,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 16:59:36,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:36,269 INFO L225 Difference]: With dead ends: 875 [2022-11-21 16:59:36,269 INFO L226 Difference]: Without dead ends: 615 [2022-11-21 16:59:36,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:59:36,270 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 75 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:36,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 24 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:59:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-11-21 16:59:36,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 579. [2022-11-21 16:59:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 578 states have (on average 2.8823529411764706) internal successors, (1666), 578 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1666 transitions. [2022-11-21 16:59:36,293 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1666 transitions. Word has length 14 [2022-11-21 16:59:36,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:36,293 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 1666 transitions. [2022-11-21 16:59:36,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:36,294 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1666 transitions. [2022-11-21 16:59:36,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:59:36,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:36,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:36,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:59:36,296 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:36,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:36,297 INFO L85 PathProgramCache]: Analyzing trace with hash -15868915, now seen corresponding path program 2 times [2022-11-21 16:59:36,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:36,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507928380] [2022-11-21 16:59:36,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:36,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:37,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:37,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:37,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507928380] [2022-11-21 16:59:37,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507928380] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:37,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:37,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:59:37,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309669603] [2022-11-21 16:59:37,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:37,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:59:37,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:37,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:59:37,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:59:37,891 INFO L87 Difference]: Start difference. First operand 579 states and 1666 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:39,341 INFO L93 Difference]: Finished difference Result 998 states and 2867 transitions. [2022-11-21 16:59:39,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 16:59:39,343 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 16:59:39,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:39,349 INFO L225 Difference]: With dead ends: 998 [2022-11-21 16:59:39,349 INFO L226 Difference]: Without dead ends: 924 [2022-11-21 16:59:39,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:59:39,350 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 94 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:39,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 22 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 16:59:39,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2022-11-21 16:59:39,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 667. [2022-11-21 16:59:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 2.8663663663663663) internal successors, (1909), 666 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1909 transitions. [2022-11-21 16:59:39,375 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1909 transitions. Word has length 14 [2022-11-21 16:59:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:39,376 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 1909 transitions. [2022-11-21 16:59:39,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1909 transitions. [2022-11-21 16:59:39,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:59:39,378 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:39,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:39,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:59:39,378 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:39,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:39,379 INFO L85 PathProgramCache]: Analyzing trace with hash -764697631, now seen corresponding path program 3 times [2022-11-21 16:59:39,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:39,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239552974] [2022-11-21 16:59:39,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:39,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:40,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:40,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239552974] [2022-11-21 16:59:40,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239552974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:40,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:40,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:59:40,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285903483] [2022-11-21 16:59:40,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:40,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:59:40,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:40,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:59:40,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:59:40,633 INFO L87 Difference]: Start difference. First operand 667 states and 1909 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:41,037 INFO L93 Difference]: Finished difference Result 957 states and 2709 transitions. [2022-11-21 16:59:41,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:59:41,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 16:59:41,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:41,041 INFO L225 Difference]: With dead ends: 957 [2022-11-21 16:59:41,041 INFO L226 Difference]: Without dead ends: 525 [2022-11-21 16:59:41,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:59:41,042 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 90 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:41,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 12 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:59:41,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-11-21 16:59:41,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 506. [2022-11-21 16:59:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 2.766336633663366) internal successors, (1397), 505 states have internal predecessors, (1397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1397 transitions. [2022-11-21 16:59:41,064 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1397 transitions. Word has length 14 [2022-11-21 16:59:41,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:41,064 INFO L495 AbstractCegarLoop]: Abstraction has 506 states and 1397 transitions. [2022-11-21 16:59:41,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:41,065 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1397 transitions. [2022-11-21 16:59:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 16:59:41,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:41,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:41,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:59:41,067 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:41,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:41,068 INFO L85 PathProgramCache]: Analyzing trace with hash 711530184, now seen corresponding path program 1 times [2022-11-21 16:59:41,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:41,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127717984] [2022-11-21 16:59:41,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:41,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:42,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:42,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127717984] [2022-11-21 16:59:42,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127717984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:42,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:42,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:59:42,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984449020] [2022-11-21 16:59:42,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:42,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:59:42,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:42,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:59:42,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:59:42,215 INFO L87 Difference]: Start difference. First operand 506 states and 1397 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:43,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:43,213 INFO L93 Difference]: Finished difference Result 753 states and 2019 transitions. [2022-11-21 16:59:43,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:59:43,214 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-21 16:59:43,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:43,217 INFO L225 Difference]: With dead ends: 753 [2022-11-21 16:59:43,218 INFO L226 Difference]: Without dead ends: 689 [2022-11-21 16:59:43,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:59:43,219 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 106 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:43,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 18 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:59:43,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2022-11-21 16:59:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 545. [2022-11-21 16:59:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 2.775735294117647) internal successors, (1510), 544 states have internal predecessors, (1510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 1510 transitions. [2022-11-21 16:59:43,239 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 1510 transitions. Word has length 15 [2022-11-21 16:59:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:43,239 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 1510 transitions. [2022-11-21 16:59:43,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:43,240 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 1510 transitions. [2022-11-21 16:59:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 16:59:43,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:43,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:43,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 16:59:43,242 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:43,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:43,242 INFO L85 PathProgramCache]: Analyzing trace with hash 955089404, now seen corresponding path program 2 times [2022-11-21 16:59:43,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:43,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978988122] [2022-11-21 16:59:43,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:43,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:44,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:44,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:44,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978988122] [2022-11-21 16:59:44,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978988122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:44,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:44,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:59:44,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763233885] [2022-11-21 16:59:44,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:44,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:59:44,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:44,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:59:44,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:59:44,341 INFO L87 Difference]: Start difference. First operand 545 states and 1510 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:44,849 INFO L93 Difference]: Finished difference Result 650 states and 1738 transitions. [2022-11-21 16:59:44,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:59:44,849 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-21 16:59:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:44,852 INFO L225 Difference]: With dead ends: 650 [2022-11-21 16:59:44,852 INFO L226 Difference]: Without dead ends: 560 [2022-11-21 16:59:44,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:59:44,853 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 56 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:44,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 18 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:59:44,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-11-21 16:59:44,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 535. [2022-11-21 16:59:44,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 2.7265917602996255) internal successors, (1456), 534 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1456 transitions. [2022-11-21 16:59:44,871 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 1456 transitions. Word has length 15 [2022-11-21 16:59:44,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:44,871 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 1456 transitions. [2022-11-21 16:59:44,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:44,872 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 1456 transitions. [2022-11-21 16:59:44,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 16:59:44,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:44,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:44,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:59:44,873 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:44,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:44,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1496407876, now seen corresponding path program 3 times [2022-11-21 16:59:44,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:44,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236312692] [2022-11-21 16:59:44,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:44,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:46,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:46,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:46,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236312692] [2022-11-21 16:59:46,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236312692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:46,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:46,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:59:46,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611200405] [2022-11-21 16:59:46,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:46,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:59:46,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:46,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:59:46,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:59:46,106 INFO L87 Difference]: Start difference. First operand 535 states and 1456 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:46,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:46,635 INFO L93 Difference]: Finished difference Result 689 states and 1814 transitions. [2022-11-21 16:59:46,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:59:46,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-21 16:59:46,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:46,638 INFO L225 Difference]: With dead ends: 689 [2022-11-21 16:59:46,638 INFO L226 Difference]: Without dead ends: 471 [2022-11-21 16:59:46,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:59:46,639 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 65 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:46,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 21 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:59:46,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-11-21 16:59:46,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 379. [2022-11-21 16:59:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 2.624338624338624) internal successors, (992), 378 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 992 transitions. [2022-11-21 16:59:46,652 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 992 transitions. Word has length 15 [2022-11-21 16:59:46,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:46,652 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 992 transitions. [2022-11-21 16:59:46,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:46,652 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 992 transitions. [2022-11-21 16:59:46,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 16:59:46,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:46,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:46,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 16:59:46,654 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:46,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:46,654 INFO L85 PathProgramCache]: Analyzing trace with hash 582514754, now seen corresponding path program 1 times [2022-11-21 16:59:46,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:46,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696875997] [2022-11-21 16:59:46,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:46,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:47,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:47,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696875997] [2022-11-21 16:59:47,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696875997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:47,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:47,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:59:47,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893820678] [2022-11-21 16:59:47,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:47,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:59:47,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:47,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:59:47,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:59:47,627 INFO L87 Difference]: Start difference. First operand 379 states and 992 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:47,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:47,950 INFO L93 Difference]: Finished difference Result 500 states and 1252 transitions. [2022-11-21 16:59:47,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:59:47,951 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 16:59:47,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:47,953 INFO L225 Difference]: With dead ends: 500 [2022-11-21 16:59:47,953 INFO L226 Difference]: Without dead ends: 372 [2022-11-21 16:59:47,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:59:47,954 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 68 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:47,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 15 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:59:47,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-11-21 16:59:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 353. [2022-11-21 16:59:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 2.5681818181818183) internal successors, (904), 352 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:47,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 904 transitions. [2022-11-21 16:59:47,966 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 904 transitions. Word has length 16 [2022-11-21 16:59:47,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:47,966 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 904 transitions. [2022-11-21 16:59:47,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:47,966 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 904 transitions. [2022-11-21 16:59:47,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 16:59:47,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:47,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:47,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 16:59:47,968 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:47,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:47,968 INFO L85 PathProgramCache]: Analyzing trace with hash -570718175, now seen corresponding path program 1 times [2022-11-21 16:59:47,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:47,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913706888] [2022-11-21 16:59:47,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:47,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:48,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:48,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913706888] [2022-11-21 16:59:48,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913706888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:48,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:48,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:59:48,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090539108] [2022-11-21 16:59:48,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:48,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:59:48,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:48,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:59:48,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:59:48,171 INFO L87 Difference]: Start difference. First operand 353 states and 904 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:48,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:48,237 INFO L93 Difference]: Finished difference Result 261 states and 586 transitions. [2022-11-21 16:59:48,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:59:48,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 16:59:48,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:48,239 INFO L225 Difference]: With dead ends: 261 [2022-11-21 16:59:48,239 INFO L226 Difference]: Without dead ends: 261 [2022-11-21 16:59:48,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:59:48,240 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:48,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:59:48,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-21 16:59:48,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2022-11-21 16:59:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 2.253846153846154) internal successors, (586), 260 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 586 transitions. [2022-11-21 16:59:48,248 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 586 transitions. Word has length 17 [2022-11-21 16:59:48,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:48,249 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 586 transitions. [2022-11-21 16:59:48,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:48,249 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 586 transitions. [2022-11-21 16:59:48,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 16:59:48,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:48,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:48,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 16:59:48,250 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:48,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:48,252 INFO L85 PathProgramCache]: Analyzing trace with hash -568089859, now seen corresponding path program 1 times [2022-11-21 16:59:48,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:48,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378472099] [2022-11-21 16:59:48,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:48,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:48,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:48,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378472099] [2022-11-21 16:59:48,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378472099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:48,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:48,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:59:48,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439279251] [2022-11-21 16:59:48,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:48,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:59:48,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:48,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:59:48,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:59:48,483 INFO L87 Difference]: Start difference. First operand 261 states and 586 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:48,561 INFO L93 Difference]: Finished difference Result 169 states and 330 transitions. [2022-11-21 16:59:48,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:59:48,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-21 16:59:48,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:48,562 INFO L225 Difference]: With dead ends: 169 [2022-11-21 16:59:48,562 INFO L226 Difference]: Without dead ends: 169 [2022-11-21 16:59:48,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:59:48,563 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:48,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:59:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-21 16:59:48,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-11-21 16:59:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.9642857142857142) internal successors, (330), 168 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 330 transitions. [2022-11-21 16:59:48,567 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 330 transitions. Word has length 18 [2022-11-21 16:59:48,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:48,568 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 330 transitions. [2022-11-21 16:59:48,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:48,568 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 330 transitions. [2022-11-21 16:59:48,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:59:48,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:48,569 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 16:59:48,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 16:59:48,570 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:48,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:48,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1146491391, now seen corresponding path program 1 times [2022-11-21 16:59:48,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:48,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185670637] [2022-11-21 16:59:48,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:48,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:50,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:50,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:50,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185670637] [2022-11-21 16:59:50,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185670637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:50,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:50,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:59:50,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274500235] [2022-11-21 16:59:50,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:50,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 16:59:50,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:50,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 16:59:50,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:59:50,781 INFO L87 Difference]: Start difference. First operand 169 states and 330 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 16:59:51,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:51,312 INFO L93 Difference]: Finished difference Result 263 states and 476 transitions. [2022-11-21 16:59:51,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:59:51,313 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 16:59:51,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:51,314 INFO L225 Difference]: With dead ends: 263 [2022-11-21 16:59:51,314 INFO L226 Difference]: Without dead ends: 116 [2022-11-21 16:59:51,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:59:51,315 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 63 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:51,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 18 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:59:51,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-21 16:59:51,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2022-11-21 16:59:51,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.7570093457943925) internal successors, (188), 107 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:51,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 188 transitions. [2022-11-21 16:59:51,319 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 188 transitions. Word has length 19 [2022-11-21 16:59:51,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:51,319 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 188 transitions. [2022-11-21 16:59:51,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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 16:59:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 188 transitions. [2022-11-21 16:59:51,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:59:51,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:51,320 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 16:59:51,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 16:59:51,320 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:51,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:51,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1120661059, now seen corresponding path program 2 times [2022-11-21 16:59:51,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:51,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551486891] [2022-11-21 16:59:51,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:51,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:53,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:53,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551486891] [2022-11-21 16:59:53,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551486891] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:53,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:53,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:59:53,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213339514] [2022-11-21 16:59:53,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:53,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:59:53,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:53,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:59:53,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:59:53,586 INFO L87 Difference]: Start difference. First operand 108 states and 188 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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 16:59:54,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:54,022 INFO L93 Difference]: Finished difference Result 108 states and 185 transitions. [2022-11-21 16:59:54,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:59:54,022 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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 16:59:54,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:54,024 INFO L225 Difference]: With dead ends: 108 [2022-11-21 16:59:54,025 INFO L226 Difference]: Without dead ends: 85 [2022-11-21 16:59:54,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:59:54,025 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:54,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 13 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:59:54,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-21 16:59:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-11-21 16:59:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.8333333333333333) internal successors, (154), 84 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 154 transitions. [2022-11-21 16:59:54,028 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 154 transitions. Word has length 19 [2022-11-21 16:59:54,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:54,028 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 154 transitions. [2022-11-21 16:59:54,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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 16:59:54,029 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 154 transitions. [2022-11-21 16:59:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 16:59:54,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:54,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:54,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 16:59:54,029 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:54,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:54,030 INFO L85 PathProgramCache]: Analyzing trace with hash -967191287, now seen corresponding path program 1 times [2022-11-21 16:59:54,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:54,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716921982] [2022-11-21 16:59:54,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:54,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:54,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:54,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:54,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716921982] [2022-11-21 16:59:54,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716921982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:54,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:54,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:59:54,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390878190] [2022-11-21 16:59:54,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:54,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:59:54,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:54,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:59:54,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:59:54,303 INFO L87 Difference]: Start difference. First operand 85 states and 154 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:54,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:54,391 INFO L93 Difference]: Finished difference Result 63 states and 110 transitions. [2022-11-21 16:59:54,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:59:54,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-21 16:59:54,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:54,392 INFO L225 Difference]: With dead ends: 63 [2022-11-21 16:59:54,392 INFO L226 Difference]: Without dead ends: 63 [2022-11-21 16:59:54,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:59:54,393 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:54,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:59:54,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-21 16:59:54,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-21 16:59:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.7741935483870968) internal successors, (110), 62 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:54,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2022-11-21 16:59:54,395 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 20 [2022-11-21 16:59:54,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:54,395 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2022-11-21 16:59:54,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:54,396 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2022-11-21 16:59:54,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:59:54,396 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:54,396 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 16:59:54,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 16:59:54,396 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 16:59:54,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:54,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2020849420, now seen corresponding path program 1 times [2022-11-21 16:59:54,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:54,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422753361] [2022-11-21 16:59:54,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:54,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:59:54,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:59:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:59:54,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:59:54,577 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:59:54,579 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-21 16:59:54,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-21 16:59:54,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-21 16:59:54,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-21 16:59:54,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-21 16:59:54,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-21 16:59:54,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-21 16:59:54,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-21 16:59:54,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-21 16:59:54,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-21 16:59:54,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-21 16:59:54,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-21 16:59:54,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-21 16:59:54,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 16:59:54,588 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:54,593 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 16:59:54,593 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:59:54,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:59:54 BasicIcfg [2022-11-21 16:59:54,685 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:59:54,685 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:59:54,685 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:59:54,685 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:59:54,686 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:59:19" (3/4) ... [2022-11-21 16:59:54,689 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 16:59:54,689 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:59:54,690 INFO L158 Benchmark]: Toolchain (without parser) took 37368.94ms. Allocated memory was 197.1MB in the beginning and 599.8MB in the end (delta: 402.7MB). Free memory was 164.5MB in the beginning and 454.4MB in the end (delta: -289.8MB). Peak memory consumption was 113.4MB. Max. memory is 16.1GB. [2022-11-21 16:59:54,690 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 134.2MB. Free memory is still 76.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:59:54,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 715.96ms. Allocated memory is still 197.1MB. Free memory was 164.5MB in the beginning and 138.8MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-21 16:59:54,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.11ms. Allocated memory is still 197.1MB. Free memory was 138.8MB in the beginning and 136.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:59:54,692 INFO L158 Benchmark]: Boogie Preprocessor took 37.26ms. Allocated memory is still 197.1MB. Free memory was 136.1MB in the beginning and 133.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:59:54,692 INFO L158 Benchmark]: RCFGBuilder took 1038.45ms. Allocated memory is still 197.1MB. Free memory was 133.7MB in the beginning and 142.5MB in the end (delta: -8.8MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2022-11-21 16:59:54,693 INFO L158 Benchmark]: TraceAbstraction took 35506.34ms. Allocated memory was 197.1MB in the beginning and 599.8MB in the end (delta: 402.7MB). Free memory was 142.5MB in the beginning and 455.4MB in the end (delta: -312.9MB). Peak memory consumption was 89.7MB. Max. memory is 16.1GB. [2022-11-21 16:59:54,696 INFO L158 Benchmark]: Witness Printer took 4.47ms. Allocated memory is still 599.8MB. Free memory was 455.4MB in the beginning and 454.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:59:54,698 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 134.2MB. Free memory is still 76.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 715.96ms. Allocated memory is still 197.1MB. Free memory was 164.5MB in the beginning and 138.8MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.11ms. Allocated memory is still 197.1MB. Free memory was 138.8MB in the beginning and 136.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.26ms. Allocated memory is still 197.1MB. Free memory was 136.1MB in the beginning and 133.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1038.45ms. Allocated memory is still 197.1MB. Free memory was 133.7MB in the beginning and 142.5MB in the end (delta: -8.8MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. * TraceAbstraction took 35506.34ms. Allocated memory was 197.1MB in the beginning and 599.8MB in the end (delta: 402.7MB). Free memory was 142.5MB in the beginning and 455.4MB in the end (delta: -312.9MB). Peak memory consumption was 89.7MB. Max. memory is 16.1GB. * Witness Printer took 4.47ms. Allocated memory is still 599.8MB. Free memory was 455.4MB in the beginning and 454.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 132 PlacesBefore, 44 PlacesAfterwards, 124 TransitionsBefore, 35 TransitionsAfterwards, 2320 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 122 TotalNumberOfCompositions, 6245 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2413, independent: 2248, independent conditional: 0, independent unconditional: 2248, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1418, independent: 1358, independent conditional: 0, independent unconditional: 1358, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1418, independent: 1335, independent conditional: 0, independent unconditional: 1335, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 816, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 772, dependent conditional: 0, dependent unconditional: 772, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2413, independent: 890, independent conditional: 0, independent unconditional: 890, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 1418, unknown conditional: 0, unknown unconditional: 1418] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 101, Positive conditional cache size: 0, Positive unconditional cache size: 101, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, 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_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1873; [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1873, ((void *)0), P0, ((void *)0))=-3, t1873={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] [L846] 0 pthread_t t1874; [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1874, ((void *)0), P1, ((void *)0))=-2, t1873={5:0}, t1874={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L848] 0 pthread_t t1875; [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1875, ((void *)0), P2, ((void *)0))=-1, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 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) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 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)) [L799] 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)) [L800] 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)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __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=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] 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) [L811] 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)) [L812] 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)) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 3 __unbuffered_p2_EBX = y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L822] 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) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 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) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 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_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L867] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L868] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L869] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L870] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L872] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 [L877] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=4, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 35.3s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 959 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 959 mSDsluCounter, 241 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 336 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2777 IncrementalHoareTripleChecker+Invalid, 3113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 336 mSolverCounterUnsat, 80 mSDtfsCounter, 2777 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1098occurred in iteration=0, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 806 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 4715 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-21 16:59:54,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:59:57,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:59:57,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:59:57,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:59:57,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:59:57,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:59:57,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:59:57,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:59:57,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:59:57,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:59:57,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:59:57,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:59:57,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:59:57,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:59:57,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:59:57,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:59:57,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:59:57,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:59:57,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:59:57,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:59:57,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:59:57,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:59:57,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:59:57,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:59:57,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:59:57,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:59:57,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:59:57,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:59:57,337 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:59:57,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:59:57,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:59:57,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:59:57,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:59:57,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:59:57,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:59:57,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:59:57,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:59:57,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:59:57,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:59:57,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:59:57,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:59:57,349 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-21 16:59:57,389 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:59:57,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:59:57,391 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:59:57,391 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:59:57,392 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:59:57,392 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:59:57,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:59:57,393 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:59:57,393 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:59:57,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:59:57,395 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:59:57,395 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:59:57,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:59:57,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:59:57,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:59:57,396 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 16:59:57,396 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 16:59:57,396 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 16:59:57,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:59:57,396 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:59:57,397 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-21 16:59:57,397 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-21 16:59:57,397 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:59:57,397 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:59:57,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:59:57,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:59:57,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:59:57,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:59:57,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:59:57,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:59:57,399 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-21 16:59:57,399 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-21 16:59:57,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-21 16:59:57,400 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_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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 -> 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 [2022-11-21 16:59:57,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:59:57,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:59:57,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:59:57,865 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:59:57,866 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:59:57,867 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 17:00:00,930 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:00:01,209 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:00:01,213 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 17:00:01,231 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/data/f29feaa10/9deee17a6180402abb66a2cf888df505/FLAG20c02ecbf [2022-11-21 17:00:01,252 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/data/f29feaa10/9deee17a6180402abb66a2cf888df505 [2022-11-21 17:00:01,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:00:01,256 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:00:01,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:00:01,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:00:01,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:00:01,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:00:01" (1/1) ... [2022-11-21 17:00:01,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65074245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:00:01, skipping insertion in model container [2022-11-21 17:00:01,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:00:01" (1/1) ... [2022-11-21 17:00:01,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:00:01,327 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:00:01,545 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_bb66bbc0-1a97-4b12-9366-be451c04ddd1/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-11-21 17:00:01,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:00:01,906 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:00:01,919 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_bb66bbc0-1a97-4b12-9366-be451c04ddd1/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-11-21 17:00:01,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:00:02,034 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:00:02,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:00:02 WrapperNode [2022-11-21 17:00:02,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:00:02,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:00:02,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:00:02,036 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:00:02,043 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:00:02" (1/1) ... [2022-11-21 17:00:02,063 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:00:02" (1/1) ... [2022-11-21 17:00:02,090 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-21 17:00:02,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:00:02,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:00:02,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:00:02,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:00:02,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:00:02" (1/1) ... [2022-11-21 17:00:02,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:00:02" (1/1) ... [2022-11-21 17:00:02,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:00:02" (1/1) ... [2022-11-21 17:00:02,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:00:02" (1/1) ... [2022-11-21 17:00:02,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:00:02" (1/1) ... [2022-11-21 17:00:02,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:00:02" (1/1) ... [2022-11-21 17:00:02,127 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:00:02" (1/1) ... [2022-11-21 17:00:02,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:00:02" (1/1) ... [2022-11-21 17:00:02,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:00:02,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:00:02,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:00:02,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:00:02,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:00:02" (1/1) ... [2022-11-21 17:00:02,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:00:02,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:00:02,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:00:02,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:00:02,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 17:00:02,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:00:02,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 17:00:02,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 17:00:02,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-21 17:00:02,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-21 17:00:02,218 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 17:00:02,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 17:00:02,218 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 17:00:02,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 17:00:02,218 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 17:00:02,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 17:00:02,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 17:00:02,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:00:02,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:00:02,221 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:00:02,380 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:00:02,383 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:00:02,905 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:00:03,112 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:00:03,112 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 17:00:03,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:00:03 BoogieIcfgContainer [2022-11-21 17:00:03,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:00:03,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:00:03,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:00:03,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:00:03,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:00:01" (1/3) ... [2022-11-21 17:00:03,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb62f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:00:03, skipping insertion in model container [2022-11-21 17:00:03,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:00:02" (2/3) ... [2022-11-21 17:00:03,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb62f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:00:03, skipping insertion in model container [2022-11-21 17:00:03,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:00:03" (3/3) ... [2022-11-21 17:00:03,124 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 17:00:03,144 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:00:03,144 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-21 17:00:03,144 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 17:00:03,223 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 17:00:03,256 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 17:00:03,273 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 125 transitions, 265 flow [2022-11-21 17:00:03,283 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 125 transitions, 265 flow [2022-11-21 17:00:03,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-11-21 17:00:03,392 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-11-21 17:00:03,394 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 17:00:03,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-21 17:00:03,406 INFO L119 LiptonReduction]: Number of co-enabled transitions 2320 [2022-11-21 17:00:12,993 INFO L134 LiptonReduction]: Checked pairs total: 6294 [2022-11-21 17:00:12,993 INFO L136 LiptonReduction]: Total number of compositions: 121 [2022-11-21 17:00:13,002 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-21 17:00:13,117 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:13,142 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:00:13,151 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;@181f960f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:00:13,152 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-21 17:00:13,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:13,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 17:00:13,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:13,164 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 17:00:13,165 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:00:13,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:13,174 INFO L85 PathProgramCache]: Analyzing trace with hash 598, now seen corresponding path program 1 times [2022-11-21 17:00:13,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:00:13,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422511233] [2022-11-21 17:00:13,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:13,188 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:00:13,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:00:13,197 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:13,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:13,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-21 17:00:13,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:00:13,308 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:00:13,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:00:13,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 17:00:13,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422511233] [2022-11-21 17:00:13,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422511233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:00:13,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:00:13,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 17:00:13,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192142477] [2022-11-21 17:00:13,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:00:13,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 17:00:13,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 17:00:13,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 17:00:13,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 17:00:13,352 INFO L87 Difference]: Start difference. First operand has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:13,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:00:13,533 INFO L93 Difference]: Finished difference Result 1024 states and 3277 transitions. [2022-11-21 17:00:13,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 17:00:13,536 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:00:13,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:00:13,576 INFO L225 Difference]: With dead ends: 1024 [2022-11-21 17:00:13,577 INFO L226 Difference]: Without dead ends: 1024 [2022-11-21 17:00:13,578 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:00:13,582 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:00:13,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:00:13,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2022-11-21 17:00:13,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2022-11-21 17:00:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1019 states have (on average 3.215897939156035) internal successors, (3277), 1023 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:13,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 3277 transitions. [2022-11-21 17:00:13,729 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 3277 transitions. Word has length 1 [2022-11-21 17:00:13,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:00:13,729 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 3277 transitions. [2022-11-21 17:00:13,729 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:00:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 3277 transitions. [2022-11-21 17:00:13,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 17:00:13,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:13,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 17:00:13,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:13,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:13,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:00:13,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:13,952 INFO L85 PathProgramCache]: Analyzing trace with hash 589892, now seen corresponding path program 1 times [2022-11-21 17:00:13,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:00:13,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080260981] [2022-11-21 17:00:13,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:13,954 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:00:13,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:00:13,955 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:13,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:14,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 17:00:14,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:00:14,115 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:00:14,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:00:14,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 17:00:14,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080260981] [2022-11-21 17:00:14,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080260981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:00:14,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:00:14,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 17:00:14,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819876189] [2022-11-21 17:00:14,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:00:14,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:00:14,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 17:00:14,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:00:14,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:00:14,125 INFO L87 Difference]: Start difference. First operand 1024 states and 3277 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:14,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:00:14,312 INFO L93 Difference]: Finished difference Result 837 states and 2640 transitions. [2022-11-21 17:00:14,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:00:14,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-21 17:00:14,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:00:14,335 INFO L225 Difference]: With dead ends: 837 [2022-11-21 17:00:14,336 INFO L226 Difference]: Without dead ends: 812 [2022-11-21 17:00:14,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:00:14,337 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:00:14,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:00:14,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-21 17:00:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2022-11-21 17:00:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 3.1790123456790123) internal successors, (2575), 811 states have internal predecessors, (2575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:14,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2022-11-21 17:00:14,425 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 3 [2022-11-21 17:00:14,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:00:14,426 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2022-11-21 17:00:14,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:14,426 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2022-11-21 17:00:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 17:00:14,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:14,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:00:14,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:14,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:14,639 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:00:14,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:14,640 INFO L85 PathProgramCache]: Analyzing trace with hash -128631079, now seen corresponding path program 1 times [2022-11-21 17:00:14,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:00:14,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584944568] [2022-11-21 17:00:14,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:14,641 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:00:14,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:00:14,643 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:14,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:14,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 17:00:14,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:00:14,846 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:00:14,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:00:14,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 17:00:14,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584944568] [2022-11-21 17:00:14,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584944568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:00:14,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:00:14,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:00:14,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804354599] [2022-11-21 17:00:14,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:00:14,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:00:14,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 17:00:14,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:00:14,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:00:14,850 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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:00:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:00:14,954 INFO L93 Difference]: Finished difference Result 492 states and 1295 transitions. [2022-11-21 17:00:14,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:00:14,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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:00:14,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:00:14,957 INFO L225 Difference]: With dead ends: 492 [2022-11-21 17:00:14,957 INFO L226 Difference]: Without dead ends: 492 [2022-11-21 17:00:14,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:00:14,959 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:00:14,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:00:14,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-11-21 17:00:14,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2022-11-21 17:00:14,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 490 states have (on average 2.642857142857143) internal successors, (1295), 491 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1295 transitions. [2022-11-21 17:00:14,992 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1295 transitions. Word has length 10 [2022-11-21 17:00:14,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:00:14,993 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 1295 transitions. [2022-11-21 17:00:14,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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:00:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1295 transitions. [2022-11-21 17:00:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 17:00:14,997 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:14,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:00:15,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:15,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:15,210 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:00:15,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:15,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1640541244, now seen corresponding path program 1 times [2022-11-21 17:00:15,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:00:15,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647066641] [2022-11-21 17:00:15,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:15,211 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:00:15,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:00:15,213 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:15,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:15,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 17:00:15,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:00:15,392 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:00:15,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:00:15,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 17:00:15,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647066641] [2022-11-21 17:00:15,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647066641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:00:15,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:00:15,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:00:15,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611591002] [2022-11-21 17:00:15,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:00:15,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:00:15,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 17:00:15,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:00:15,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:00:15,396 INFO L87 Difference]: Start difference. First operand 492 states and 1295 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:00:15,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:00:15,542 INFO L93 Difference]: Finished difference Result 252 states and 575 transitions. [2022-11-21 17:00:15,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:00:15,543 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:00:15,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:00:15,544 INFO L225 Difference]: With dead ends: 252 [2022-11-21 17:00:15,544 INFO L226 Difference]: Without dead ends: 252 [2022-11-21 17:00:15,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:00:15,546 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:00:15,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 8 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:00:15,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-21 17:00:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2022-11-21 17:00:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 250 states have (on average 2.3) internal successors, (575), 251 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 575 transitions. [2022-11-21 17:00:15,555 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 575 transitions. Word has length 14 [2022-11-21 17:00:15,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:00:15,555 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 575 transitions. [2022-11-21 17:00:15,555 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:00:15,556 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 575 transitions. [2022-11-21 17:00:15,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 17:00:15,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:15,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:00:15,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:15,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:15,775 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:00:15,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1932458586, now seen corresponding path program 1 times [2022-11-21 17:00:15,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:00:15,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363088744] [2022-11-21 17:00:15,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:15,777 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:00:15,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:00:15,778 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:15,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:15,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 17:00:15,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:00:16,003 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:00:16,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:00:16,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 17:00:16,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363088744] [2022-11-21 17:00:16,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363088744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:00:16,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:00:16,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:00:16,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456678072] [2022-11-21 17:00:16,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:00:16,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:00:16,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 17:00:16,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:00:16,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:00:16,006 INFO L87 Difference]: Start difference. First operand 252 states and 575 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:16,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:00:16,229 INFO L93 Difference]: Finished difference Result 192 states and 455 transitions. [2022-11-21 17:00:16,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:00:16,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-21 17:00:16,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:00:16,231 INFO L225 Difference]: With dead ends: 192 [2022-11-21 17:00:16,231 INFO L226 Difference]: Without dead ends: 192 [2022-11-21 17:00:16,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:00:16,232 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:00:16,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 18 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:00:16,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-21 17:00:16,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-11-21 17:00:16,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 2.3947368421052633) internal successors, (455), 191 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 455 transitions. [2022-11-21 17:00:16,239 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 455 transitions. Word has length 18 [2022-11-21 17:00:16,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:00:16,239 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 455 transitions. [2022-11-21 17:00:16,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:16,240 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 455 transitions. [2022-11-21 17:00:16,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 17:00:16,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:16,241 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:00:16,257 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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)] Ended with exit code 0 [2022-11-21 17:00:16,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:16,453 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:00:16,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:16,454 INFO L85 PathProgramCache]: Analyzing trace with hash 816763350, now seen corresponding path program 1 times [2022-11-21 17:00:16,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:00:16,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667985706] [2022-11-21 17:00:16,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:16,455 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:00:16,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:00:16,456 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:16,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:16,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-21 17:00:16,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:00:17,047 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:00:17,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:00:17,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 17:00:17,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667985706] [2022-11-21 17:00:17,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667985706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:00:17,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:00:17,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:00:17,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208119224] [2022-11-21 17:00:17,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:00:17,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:00:17,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 17:00:17,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:00:17,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:00:17,049 INFO L87 Difference]: Start difference. First operand 192 states and 455 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:00:17,308 INFO L93 Difference]: Finished difference Result 191 states and 454 transitions. [2022-11-21 17:00:17,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:00:17,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 17:00:17,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:00:17,310 INFO L225 Difference]: With dead ends: 191 [2022-11-21 17:00:17,310 INFO L226 Difference]: Without dead ends: 191 [2022-11-21 17:00:17,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:00:17,311 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:00:17,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 15 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:00:17,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-21 17:00:17,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-11-21 17:00:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 2.389473684210526) internal successors, (454), 190 states have internal predecessors, (454), 0 states have call successors, (0), 0 states 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:00:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 454 transitions. [2022-11-21 17:00:17,317 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 454 transitions. Word has length 22 [2022-11-21 17:00:17,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:00:17,317 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 454 transitions. [2022-11-21 17:00:17,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:17,318 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 454 transitions. [2022-11-21 17:00:17,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 17:00:17,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:17,319 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:00:17,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:17,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:17,532 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:00:17,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:17,533 INFO L85 PathProgramCache]: Analyzing trace with hash 816763292, now seen corresponding path program 1 times [2022-11-21 17:00:17,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:00:17,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781381820] [2022-11-21 17:00:17,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:17,534 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:00:17,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:00:17,535 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:17,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:17,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 17:00:17,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:00:18,613 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:00:18,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:00:18,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 17:00:18,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781381820] [2022-11-21 17:00:18,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781381820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:00:18,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:00:18,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 17:00:18,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740593147] [2022-11-21 17:00:18,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:00:18,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 17:00:18,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 17:00:18,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 17:00:18,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-21 17:00:18,621 INFO L87 Difference]: Start difference. First operand 191 states and 454 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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:00:19,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:00:19,451 INFO L93 Difference]: Finished difference Result 272 states and 615 transitions. [2022-11-21 17:00:19,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 17:00:19,452 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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:00:19,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:00:19,453 INFO L225 Difference]: With dead ends: 272 [2022-11-21 17:00:19,453 INFO L226 Difference]: Without dead ends: 212 [2022-11-21 17:00:19,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-11-21 17:00:19,455 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 86 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:00:19,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 17 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:00:19,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-21 17:00:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 167. [2022-11-21 17:00:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 2.3012048192771086) internal successors, (382), 166 states have internal predecessors, (382), 0 states have call successors, (0), 0 states 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:00:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 382 transitions. [2022-11-21 17:00:19,463 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 382 transitions. Word has length 22 [2022-11-21 17:00:19,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:00:19,464 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 382 transitions. [2022-11-21 17:00:19,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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:00:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 382 transitions. [2022-11-21 17:00:19,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 17:00:19,465 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:19,466 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:00:19,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:19,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:19,681 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:00:19,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:19,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1187952186, now seen corresponding path program 2 times [2022-11-21 17:00:19,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:00:19,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282881652] [2022-11-21 17:00:19,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:00:19,683 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:00:19,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:00:19,685 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:19,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:19,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 17:00:19,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:00:19,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 17:00:19,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:00:20,205 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:00:20,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:00:20,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 17:00:20,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282881652] [2022-11-21 17:00:20,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282881652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:00:20,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:00:20,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:00:20,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208527555] [2022-11-21 17:00:20,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:00:20,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:00:20,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 17:00:20,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:00:20,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:00:20,208 INFO L87 Difference]: Start difference. First operand 167 states and 382 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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:00:20,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:00:20,651 INFO L93 Difference]: Finished difference Result 251 states and 545 transitions. [2022-11-21 17:00:20,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 17:00:20,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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:00:20,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:00:20,653 INFO L225 Difference]: With dead ends: 251 [2022-11-21 17:00:20,653 INFO L226 Difference]: Without dead ends: 198 [2022-11-21 17:00:20,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-21 17:00:20,654 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 40 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:00:20,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 16 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 17:00:20,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-21 17:00:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 151. [2022-11-21 17:00:20,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.2933333333333334) internal successors, (344), 150 states have internal predecessors, (344), 0 states have call successors, (0), 0 states 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:00:20,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 344 transitions. [2022-11-21 17:00:20,662 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 344 transitions. Word has length 22 [2022-11-21 17:00:20,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:00:20,662 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 344 transitions. [2022-11-21 17:00:20,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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:00:20,663 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 344 transitions. [2022-11-21 17:00:20,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 17:00:20,664 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:20,664 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:00:20,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:20,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:20,878 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 17:00:20,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:20,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1655967324, now seen corresponding path program 3 times [2022-11-21 17:00:20,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 17:00:20,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323789977] [2022-11-21 17:00:20,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 17:00:20,880 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:00:20,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 17:00:20,881 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:20,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-21 17:00:21,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-21 17:00:21,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 17:00:21,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:00:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:00:21,295 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-21 17:00:21,296 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 17:00:21,297 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-21 17:00:21,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-21 17:00:21,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-21 17:00:21,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-21 17:00:21,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-21 17:00:21,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-21 17:00:21,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-21 17:00:21,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-21 17:00:21,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-21 17:00:21,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-21 17:00:21,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-21 17:00:21,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-21 17:00:21,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-21 17:00:21,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-21 17:00:21,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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:00:21,515 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2022-11-21 17:00:21,521 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 17:00:21,521 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 17:00:21,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 05:00:21 BasicIcfg [2022-11-21 17:00:21,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 17:00:21,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 17:00:21,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 17:00:21,631 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 17:00:21,631 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:00:03" (3/4) ... [2022-11-21 17:00:21,634 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 17:00:21,634 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 17:00:21,635 INFO L158 Benchmark]: Toolchain (without parser) took 20378.52ms. Allocated memory was 69.2MB in the beginning and 192.9MB in the end (delta: 123.7MB). Free memory was 40.4MB in the beginning and 71.0MB in the end (delta: -30.6MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. [2022-11-21 17:00:21,635 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 69.2MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:00:21,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 775.76ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 40.1MB in the beginning and 55.9MB in the end (delta: -15.8MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2022-11-21 17:00:21,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.56ms. Allocated memory is still 90.2MB. Free memory was 55.9MB in the beginning and 53.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 17:00:21,636 INFO L158 Benchmark]: Boogie Preprocessor took 42.79ms. Allocated memory is still 90.2MB. Free memory was 53.2MB in the beginning and 50.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:00:21,637 INFO L158 Benchmark]: RCFGBuilder took 980.86ms. Allocated memory is still 90.2MB. Free memory was 50.7MB in the beginning and 44.5MB in the end (delta: 6.2MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2022-11-21 17:00:21,637 INFO L158 Benchmark]: TraceAbstraction took 18512.75ms. Allocated memory was 90.2MB in the beginning and 192.9MB in the end (delta: 102.8MB). Free memory was 43.5MB in the beginning and 71.0MB in the end (delta: -27.5MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. [2022-11-21 17:00:21,637 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 192.9MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:00:21,640 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 69.2MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 775.76ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 40.1MB in the beginning and 55.9MB in the end (delta: -15.8MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.56ms. Allocated memory is still 90.2MB. Free memory was 55.9MB in the beginning and 53.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.79ms. Allocated memory is still 90.2MB. Free memory was 53.2MB in the beginning and 50.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 980.86ms. Allocated memory is still 90.2MB. Free memory was 50.7MB in the beginning and 44.5MB in the end (delta: 6.2MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18512.75ms. Allocated memory was 90.2MB in the beginning and 192.9MB in the end (delta: 102.8MB). Free memory was 43.5MB in the beginning and 71.0MB in the end (delta: -27.5MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 192.9MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.7s, 133 PlacesBefore, 44 PlacesAfterwards, 125 TransitionsBefore, 35 TransitionsAfterwards, 2320 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 121 TotalNumberOfCompositions, 6294 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2451, independent: 2286, independent conditional: 0, independent unconditional: 2286, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1441, independent: 1381, independent conditional: 0, independent unconditional: 1381, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1441, independent: 1351, independent conditional: 0, independent unconditional: 1351, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 90, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 756, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 674, dependent conditional: 0, dependent unconditional: 674, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2451, independent: 905, independent conditional: 0, independent unconditional: 905, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 1441, unknown conditional: 0, unknown unconditional: 1441] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, 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_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1873; [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1873, ((void *)0), P0, ((void *)0))=-1, t1873={-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] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 pthread_t t1874; [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1874, ((void *)0), P1, ((void *)0))=0, t1873={-6:0}, t1874={-10:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L848] 0 pthread_t t1875; [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1875, ((void *)0), P2, ((void *)0))=1, t1873={-6:0}, t1874={-10:0}, t1875={-2:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 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) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 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)) [L799] 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)) [L800] 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)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __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=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] 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) [L811] 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)) [L812] 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)) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 3 __unbuffered_p2_EBX = y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L822] 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) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 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) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 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_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873={-6:0}, t1874={-10:0}, t1875={-2:0}, weak$$choice0=4, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L867] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L868] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L869] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L870] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L872] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 [L877] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 152 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 18.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 206 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 206 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 854 IncrementalHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 28 mSDtfsCounter, 854 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1098occurred in iteration=0, InterpolantAutomatonStates: 42, 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, 8 MinimizatonAttempts, 92 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 104 ConstructedInterpolants, 9 QuantifiedInterpolants, 1200 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1047 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-21 17:00:21,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb66bbc0-1a97-4b12-9366-be451c04ddd1/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