./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix019_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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/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_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/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_78ed0fcc-b4f1-4733-80e9-4ab37464001d/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 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 13:55:00,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:55:00,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:55:00,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:55:00,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:55:00,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:55:00,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:55:00,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:55:00,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:55:00,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:55:00,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:55:00,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:55:00,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:55:00,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:55:00,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:55:00,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:55:00,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:55:00,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:55:00,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:55:00,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:55:00,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:55:00,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:55:00,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:55:00,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:55:00,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:55:00,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:55:00,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:55:00,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:55:00,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:55:00,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:55:00,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:55:00,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:55:00,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:55:00,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:55:00,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:55:00,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:55:00,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:55:00,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:55:00,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:55:00,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:55:00,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:55:00,631 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 13:55:00,670 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:55:00,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:55:00,671 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:55:00,671 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:55:00,672 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:55:00,673 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:55:00,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:55:00,674 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:55:00,674 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:55:00,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:55:00,676 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:55:00,676 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:55:00,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:55:00,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:55:00,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:55:00,677 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 13:55:00,677 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 13:55:00,678 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 13:55:00,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:55:00,678 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 13:55:00,678 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:55:00,679 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:55:00,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:55:00,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:55:00,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:55:00,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:55:00,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:55:00,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:55:00,681 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:55:00,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:55:00,682 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_78ed0fcc-b4f1-4733-80e9-4ab37464001d/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_78ed0fcc-b4f1-4733-80e9-4ab37464001d/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 -> 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 [2022-11-21 13:55:00,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:55:01,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:55:01,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:55:01,021 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:55:01,021 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:55:01,022 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 13:55:04,100 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:55:04,375 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:55:04,376 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 13:55:04,405 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/data/ac84b4ad1/52d189f4d9634a6e8d8f7cf8caceaab7/FLAGf2359234a [2022-11-21 13:55:04,419 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/data/ac84b4ad1/52d189f4d9634a6e8d8f7cf8caceaab7 [2022-11-21 13:55:04,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:55:04,424 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:55:04,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:55:04,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:55:04,433 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:55:04,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:55:04" (1/1) ... [2022-11-21 13:55:04,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@424d05a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:04, skipping insertion in model container [2022-11-21 13:55:04,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:55:04" (1/1) ... [2022-11-21 13:55:04,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:55:04,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:55:04,647 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_78ed0fcc-b4f1-4733-80e9-4ab37464001d/sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-21 13:55:04,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:55:04,951 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:55:04,974 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_78ed0fcc-b4f1-4733-80e9-4ab37464001d/sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-21 13:55:05,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:55:05,099 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:55:05,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:05 WrapperNode [2022-11-21 13:55:05,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:55:05,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:55:05,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:55:05,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:55:05,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:05" (1/1) ... [2022-11-21 13:55:05,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:05" (1/1) ... [2022-11-21 13:55:05,195 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-11-21 13:55:05,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:55:05,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:55:05,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:55:05,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:55:05,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:05" (1/1) ... [2022-11-21 13:55:05,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:05" (1/1) ... [2022-11-21 13:55:05,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:05" (1/1) ... [2022-11-21 13:55:05,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:05" (1/1) ... [2022-11-21 13:55:05,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:05" (1/1) ... [2022-11-21 13:55:05,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:05" (1/1) ... [2022-11-21 13:55:05,250 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:05" (1/1) ... [2022-11-21 13:55:05,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:05" (1/1) ... [2022-11-21 13:55:05,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:55:05,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:55:05,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:55:05,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:55:05,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:05" (1/1) ... [2022-11-21 13:55:05,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:55:05,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:05,316 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:05,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:55:05,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 13:55:05,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 13:55:05,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:55:05,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 13:55:05,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:55:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 13:55:05,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 13:55:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 13:55:05,363 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 13:55:05,363 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 13:55:05,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 13:55:05,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 13:55:05,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 13:55:05,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:55:05,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:55:05,366 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 13:55:05,576 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:55:05,578 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:55:06,170 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:55:06,325 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:55:06,325 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 13:55:06,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:55:06 BoogieIcfgContainer [2022-11-21 13:55:06,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:55:06,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:55:06,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:55:06,334 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:55:06,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:55:04" (1/3) ... [2022-11-21 13:55:06,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68efd4d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:55:06, skipping insertion in model container [2022-11-21 13:55:06,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:05" (2/3) ... [2022-11-21 13:55:06,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68efd4d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:55:06, skipping insertion in model container [2022-11-21 13:55:06,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:55:06" (3/3) ... [2022-11-21 13:55:06,348 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 13:55:06,370 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:55:06,371 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-21 13:55:06,371 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 13:55:06,442 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 13:55:06,486 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 13:55:06,504 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 127 transitions, 269 flow [2022-11-21 13:55:06,507 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 127 transitions, 269 flow [2022-11-21 13:55:06,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 269 flow [2022-11-21 13:55:06,566 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-11-21 13:55:06,567 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 13:55:06,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-11-21 13:55:06,574 INFO L119 LiptonReduction]: Number of co-enabled transitions 2422 [2022-11-21 13:55:12,210 INFO L134 LiptonReduction]: Checked pairs total: 6391 [2022-11-21 13:55:12,210 INFO L136 LiptonReduction]: Total number of compositions: 124 [2022-11-21 13:55:12,219 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 36 transitions, 87 flow [2022-11-21 13:55:12,319 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:12,339 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:55:12,346 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;@13a6594b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:55:12,346 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-21 13:55:12,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:12,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 13:55:12,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:12,359 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 13:55:12,359 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 13:55:12,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:12,365 INFO L85 PathProgramCache]: Analyzing trace with hash 547, now seen corresponding path program 1 times [2022-11-21 13:55:12,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:12,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336888393] [2022-11-21 13:55:12,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:12,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:12,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:12,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:12,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336888393] [2022-11-21 13:55:12,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336888393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:12,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:12,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 13:55:12,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709854995] [2022-11-21 13:55:12,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:12,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 13:55:12,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:12,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 13:55:12,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:55:12,566 INFO L87 Difference]: Start difference. First operand has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:12,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:12,702 INFO L93 Difference]: Finished difference Result 1214 states and 3934 transitions. [2022-11-21 13:55:12,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 13:55:12,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-21 13:55:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:12,745 INFO L225 Difference]: With dead ends: 1214 [2022-11-21 13:55:12,746 INFO L226 Difference]: Without dead ends: 1214 [2022-11-21 13:55:12,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:55:12,751 INFO L413 NwaCegarLoop]: 3 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, 3 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:12,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:55:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2022-11-21 13:55:12,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2022-11-21 13:55:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1209 states have (on average 3.2539288668320925) internal successors, (3934), 1213 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3934 transitions. [2022-11-21 13:55:12,875 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3934 transitions. Word has length 1 [2022-11-21 13:55:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:12,876 INFO L495 AbstractCegarLoop]: Abstraction has 1214 states and 3934 transitions. [2022-11-21 13:55:12,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:12,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3934 transitions. [2022-11-21 13:55:12,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 13:55:12,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:12,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 13:55:12,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 13:55:12,883 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 13:55:12,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:12,884 INFO L85 PathProgramCache]: Analyzing trace with hash 537260, now seen corresponding path program 1 times [2022-11-21 13:55:12,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:12,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910479883] [2022-11-21 13:55:12,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:12,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:13,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:13,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910479883] [2022-11-21 13:55:13,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910479883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:13,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:13,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 13:55:13,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038849271] [2022-11-21 13:55:13,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:13,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:55:13,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:13,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:55:13,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:55:13,299 INFO L87 Difference]: Start difference. First operand 1214 states and 3934 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:13,395 INFO L93 Difference]: Finished difference Result 992 states and 3169 transitions. [2022-11-21 13:55:13,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:55:13,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-21 13:55:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:13,403 INFO L225 Difference]: With dead ends: 992 [2022-11-21 13:55:13,403 INFO L226 Difference]: Without dead ends: 962 [2022-11-21 13:55:13,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:55:13,412 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:13,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 6 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:55:13,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-11-21 13:55:13,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2022-11-21 13:55:13,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 960 states have (on average 3.21875) internal successors, (3090), 961 states have internal predecessors, (3090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 3090 transitions. [2022-11-21 13:55:13,452 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 3090 transitions. Word has length 3 [2022-11-21 13:55:13,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:13,452 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 3090 transitions. [2022-11-21 13:55:13,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 3090 transitions. [2022-11-21 13:55:13,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 13:55:13,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:13,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:13,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 13:55:13,458 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 13:55:13,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:13,459 INFO L85 PathProgramCache]: Analyzing trace with hash 140242197, now seen corresponding path program 1 times [2022-11-21 13:55:13,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:13,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875628083] [2022-11-21 13:55:13,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:13,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:13,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:13,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875628083] [2022-11-21 13:55:13,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875628083] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:13,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:13,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:55:13,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255734345] [2022-11-21 13:55:13,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:13,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:55:13,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:13,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:55:13,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:55:13,846 INFO L87 Difference]: Start difference. First operand 962 states and 3090 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 13:55:14,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:14,074 INFO L93 Difference]: Finished difference Result 1928 states and 5956 transitions. [2022-11-21 13:55:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:55:14,076 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 13:55:14,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:14,088 INFO L225 Difference]: With dead ends: 1928 [2022-11-21 13:55:14,089 INFO L226 Difference]: Without dead ends: 1928 [2022-11-21 13:55:14,089 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 13:55:14,090 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:14,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 12 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:55:14,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2022-11-21 13:55:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1368. [2022-11-21 13:55:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 1366 states have (on average 3.2298682284040994) internal successors, (4412), 1367 states have internal predecessors, (4412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 4412 transitions. [2022-11-21 13:55:14,150 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 4412 transitions. Word has length 10 [2022-11-21 13:55:14,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:14,152 INFO L495 AbstractCegarLoop]: Abstraction has 1368 states and 4412 transitions. [2022-11-21 13:55:14,152 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 13:55:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 4412 transitions. [2022-11-21 13:55:14,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 13:55:14,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:14,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:14,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 13:55:14,163 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 13:55:14,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:14,164 INFO L85 PathProgramCache]: Analyzing trace with hash 140242262, now seen corresponding path program 1 times [2022-11-21 13:55:14,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:14,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539990756] [2022-11-21 13:55:14,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:14,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:14,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:14,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539990756] [2022-11-21 13:55:14,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539990756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:14,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:14,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:55:14,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421257095] [2022-11-21 13:55:14,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:14,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:55:14,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:14,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:55:14,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:55:14,619 INFO L87 Difference]: Start difference. First operand 1368 states and 4412 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:14,756 INFO L93 Difference]: Finished difference Result 1218 states and 3757 transitions. [2022-11-21 13:55:14,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:55:14,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 13:55:14,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:14,763 INFO L225 Difference]: With dead ends: 1218 [2022-11-21 13:55:14,763 INFO L226 Difference]: Without dead ends: 987 [2022-11-21 13:55:14,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 13:55:14,767 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 26 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 18 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.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:14,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 18 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:55:14,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2022-11-21 13:55:14,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 987. [2022-11-21 13:55:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 986 states have (on average 3.0983772819472617) internal successors, (3055), 986 states have internal predecessors, (3055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 3055 transitions. [2022-11-21 13:55:14,847 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 3055 transitions. Word has length 10 [2022-11-21 13:55:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:14,848 INFO L495 AbstractCegarLoop]: Abstraction has 987 states and 3055 transitions. [2022-11-21 13:55:14,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:14,848 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 3055 transitions. [2022-11-21 13:55:14,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 13:55:14,849 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:14,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:14,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 13:55:14,850 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 13:55:14,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:14,851 INFO L85 PathProgramCache]: Analyzing trace with hash 879897345, now seen corresponding path program 1 times [2022-11-21 13:55:14,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:14,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807304229] [2022-11-21 13:55:14,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:14,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:15,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:15,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807304229] [2022-11-21 13:55:15,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807304229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:15,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:15,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:55:15,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473533219] [2022-11-21 13:55:15,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:15,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:55:15,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:15,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:55:15,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:55:15,019 INFO L87 Difference]: Start difference. First operand 987 states and 3055 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:15,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:15,139 INFO L93 Difference]: Finished difference Result 1027 states and 3097 transitions. [2022-11-21 13:55:15,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:55:15,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-21 13:55:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:15,146 INFO L225 Difference]: With dead ends: 1027 [2022-11-21 13:55:15,146 INFO L226 Difference]: Without dead ends: 907 [2022-11-21 13:55:15,147 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 13:55:15,149 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:15,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 13 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:55:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-11-21 13:55:15,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 811. [2022-11-21 13:55:15,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 3.0753086419753086) internal successors, (2491), 810 states have internal predecessors, (2491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2491 transitions. [2022-11-21 13:55:15,190 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 2491 transitions. Word has length 11 [2022-11-21 13:55:15,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:15,191 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 2491 transitions. [2022-11-21 13:55:15,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 2491 transitions. [2022-11-21 13:55:15,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 13:55:15,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:15,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:15,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 13:55:15,193 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 13:55:15,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:15,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1023810230, now seen corresponding path program 1 times [2022-11-21 13:55:15,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:15,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798576933] [2022-11-21 13:55:15,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:15,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:15,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:15,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798576933] [2022-11-21 13:55:15,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798576933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:15,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:15,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:55:15,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016883328] [2022-11-21 13:55:15,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:15,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:55:15,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:15,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:55:15,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:55:15,349 INFO L87 Difference]: Start difference. First operand 811 states and 2491 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:15,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:15,474 INFO L93 Difference]: Finished difference Result 895 states and 2674 transitions. [2022-11-21 13:55:15,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:55:15,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-21 13:55:15,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:15,480 INFO L225 Difference]: With dead ends: 895 [2022-11-21 13:55:15,480 INFO L226 Difference]: Without dead ends: 795 [2022-11-21 13:55:15,480 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 13:55:15,481 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:15,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 11 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:55:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-11-21 13:55:15,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2022-11-21 13:55:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 3.061712846347607) internal successors, (2431), 794 states have internal predecessors, (2431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 2431 transitions. [2022-11-21 13:55:15,508 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 2431 transitions. Word has length 12 [2022-11-21 13:55:15,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:15,509 INFO L495 AbstractCegarLoop]: Abstraction has 795 states and 2431 transitions. [2022-11-21 13:55:15,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 2431 transitions. [2022-11-21 13:55:15,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 13:55:15,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:15,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:15,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 13:55:15,511 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 13:55:15,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:15,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1132163678, now seen corresponding path program 1 times [2022-11-21 13:55:15,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:15,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976172002] [2022-11-21 13:55:15,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:15,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:15,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:15,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:15,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976172002] [2022-11-21 13:55:15,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976172002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:15,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:15,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:55:15,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975855553] [2022-11-21 13:55:15,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:15,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:55:15,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:15,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:55:15,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:55:15,706 INFO L87 Difference]: Start difference. First operand 795 states and 2431 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:15,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:15,817 INFO L93 Difference]: Finished difference Result 702 states and 1866 transitions. [2022-11-21 13:55:15,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:55:15,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-21 13:55:15,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:15,821 INFO L225 Difference]: With dead ends: 702 [2022-11-21 13:55:15,821 INFO L226 Difference]: Without dead ends: 519 [2022-11-21 13:55:15,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:55:15,822 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 44 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:15,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 9 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:55:15,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-11-21 13:55:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 519. [2022-11-21 13:55:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 2.577220077220077) internal successors, (1335), 518 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:15,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1335 transitions. [2022-11-21 13:55:15,837 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 1335 transitions. Word has length 13 [2022-11-21 13:55:15,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:15,838 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 1335 transitions. [2022-11-21 13:55:15,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:15,838 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1335 transitions. [2022-11-21 13:55:15,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 13:55:15,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:15,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:15,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 13:55:15,840 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 13:55:15,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:15,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1800748186, now seen corresponding path program 1 times [2022-11-21 13:55:15,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:15,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15100235] [2022-11-21 13:55:15,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:15,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:16,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:16,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:16,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15100235] [2022-11-21 13:55:16,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15100235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:16,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:16,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:55:16,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177829965] [2022-11-21 13:55:16,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:16,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:55:16,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:16,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:55:16,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:55:16,021 INFO L87 Difference]: Start difference. First operand 519 states and 1335 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:16,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:16,195 INFO L93 Difference]: Finished difference Result 789 states and 1969 transitions. [2022-11-21 13:55:16,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:55:16,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 13:55:16,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:16,198 INFO L225 Difference]: With dead ends: 789 [2022-11-21 13:55:16,198 INFO L226 Difference]: Without dead ends: 506 [2022-11-21 13:55:16,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:55:16,199 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 34 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:16,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 15 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:55:16,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2022-11-21 13:55:16,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 440. [2022-11-21 13:55:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 2.4943052391799543) internal successors, (1095), 439 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:16,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1095 transitions. [2022-11-21 13:55:16,213 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1095 transitions. Word has length 16 [2022-11-21 13:55:16,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:16,214 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 1095 transitions. [2022-11-21 13:55:16,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:16,214 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1095 transitions. [2022-11-21 13:55:16,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 13:55:16,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:16,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:16,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 13:55:16,216 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 13:55:16,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:16,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1181615770, now seen corresponding path program 1 times [2022-11-21 13:55:16,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:16,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418359686] [2022-11-21 13:55:16,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:16,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:16,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:16,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418359686] [2022-11-21 13:55:16,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418359686] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:16,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:16,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:55:16,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563092356] [2022-11-21 13:55:16,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:16,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:55:16,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:16,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:55:16,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:55:16,464 INFO L87 Difference]: Start difference. First operand 440 states and 1095 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:16,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:16,597 INFO L93 Difference]: Finished difference Result 332 states and 749 transitions. [2022-11-21 13:55:16,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:55:16,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 13:55:16,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:16,599 INFO L225 Difference]: With dead ends: 332 [2022-11-21 13:55:16,599 INFO L226 Difference]: Without dead ends: 262 [2022-11-21 13:55:16,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:55:16,600 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 83 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:16,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 12 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:55:16,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-21 13:55:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-11-21 13:55:16,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 2.210727969348659) internal successors, (577), 261 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 577 transitions. [2022-11-21 13:55:16,608 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 577 transitions. Word has length 16 [2022-11-21 13:55:16,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:16,609 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 577 transitions. [2022-11-21 13:55:16,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:16,609 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 577 transitions. [2022-11-21 13:55:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 13:55:16,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:16,610 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 13:55:16,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 13:55:16,610 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 13:55:16,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:16,611 INFO L85 PathProgramCache]: Analyzing trace with hash -601879790, now seen corresponding path program 1 times [2022-11-21 13:55:16,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:16,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528244453] [2022-11-21 13:55:16,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:16,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:16,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:16,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528244453] [2022-11-21 13:55:16,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528244453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:16,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:16,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:55:16,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192000641] [2022-11-21 13:55:16,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:16,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:55:16,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:16,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:55:16,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:55:16,929 INFO L87 Difference]: Start difference. First operand 262 states and 577 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:17,057 INFO L93 Difference]: Finished difference Result 230 states and 512 transitions. [2022-11-21 13:55:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:55:17,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 13:55:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:17,059 INFO L225 Difference]: With dead ends: 230 [2022-11-21 13:55:17,059 INFO L226 Difference]: Without dead ends: 152 [2022-11-21 13:55:17,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:55:17,060 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 93 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:17,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 8 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:55:17,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-21 13:55:17,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-11-21 13:55:17,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 2.218543046357616) internal successors, (335), 151 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 335 transitions. [2022-11-21 13:55:17,064 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 335 transitions. Word has length 19 [2022-11-21 13:55:17,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:17,065 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 335 transitions. [2022-11-21 13:55:17,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 335 transitions. [2022-11-21 13:55:17,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-21 13:55:17,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:17,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:17,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 13:55:17,066 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 13:55:17,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:17,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1807926174, now seen corresponding path program 1 times [2022-11-21 13:55:17,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:17,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384271977] [2022-11-21 13:55:17,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:17,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:18,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:18,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384271977] [2022-11-21 13:55:18,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384271977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:18,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:18,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:55:18,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939275247] [2022-11-21 13:55:18,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:18,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:55:18,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:18,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:55:18,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:55:18,081 INFO L87 Difference]: Start difference. First operand 152 states and 335 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:18,370 INFO L93 Difference]: Finished difference Result 219 states and 471 transitions. [2022-11-21 13:55:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:55:18,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-21 13:55:18,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:18,372 INFO L225 Difference]: With dead ends: 219 [2022-11-21 13:55:18,372 INFO L226 Difference]: Without dead ends: 132 [2022-11-21 13:55:18,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:55:18,373 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 35 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:18,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 41 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:55:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-21 13:55:18,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 118. [2022-11-21 13:55:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.0256410256410255) internal successors, (237), 117 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:18,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 237 transitions. [2022-11-21 13:55:18,377 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 237 transitions. Word has length 23 [2022-11-21 13:55:18,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:18,377 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 237 transitions. [2022-11-21 13:55:18,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:18,377 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 237 transitions. [2022-11-21 13:55:18,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-21 13:55:18,378 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:18,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:18,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 13:55:18,381 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 13:55:18,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:18,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1959799392, now seen corresponding path program 2 times [2022-11-21 13:55:18,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:18,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872566653] [2022-11-21 13:55:18,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:18,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:18,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:55:18,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872566653] [2022-11-21 13:55:18,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872566653] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:18,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:18,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:55:18,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434873385] [2022-11-21 13:55:18,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:18,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:55:18,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:18,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:55:18,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:55:18,994 INFO L87 Difference]: Start difference. First operand 118 states and 237 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:19,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:19,260 INFO L93 Difference]: Finished difference Result 182 states and 363 transitions. [2022-11-21 13:55:19,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:55:19,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-21 13:55:19,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:19,262 INFO L225 Difference]: With dead ends: 182 [2022-11-21 13:55:19,262 INFO L226 Difference]: Without dead ends: 147 [2022-11-21 13:55:19,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-21 13:55:19,263 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 56 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:19,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 27 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:55:19,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-21 13:55:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 98. [2022-11-21 13:55:19,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.9278350515463918) internal successors, (187), 97 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 187 transitions. [2022-11-21 13:55:19,267 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 187 transitions. Word has length 23 [2022-11-21 13:55:19,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:19,267 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 187 transitions. [2022-11-21 13:55:19,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:19,267 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 187 transitions. [2022-11-21 13:55:19,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-21 13:55:19,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:19,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:19,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 13:55:19,268 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 13:55:19,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:19,270 INFO L85 PathProgramCache]: Analyzing trace with hash 506641344, now seen corresponding path program 3 times [2022-11-21 13:55:19,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:55:19,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344658418] [2022-11-21 13:55:19,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:19,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:55:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:19,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:19,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 13:55:19,407 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 13:55:19,408 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-21 13:55:19,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-21 13:55:19,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-21 13:55:19,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-21 13:55:19,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-21 13:55:19,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-21 13:55:19,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-21 13:55:19,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-21 13:55:19,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-21 13:55:19,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-21 13:55:19,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-21 13:55:19,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-21 13:55:19,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-21 13:55:19,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 13:55:19,421 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:19,426 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 13:55:19,427 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 13:55:19,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:55:19 BasicIcfg [2022-11-21 13:55:19,538 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 13:55:19,539 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 13:55:19,539 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 13:55:19,539 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 13:55:19,540 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:55:06" (3/4) ... [2022-11-21 13:55:19,543 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 13:55:19,543 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 13:55:19,543 INFO L158 Benchmark]: Toolchain (without parser) took 15119.86ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 112.4MB in the beginning and 114.0MB in the end (delta: -1.6MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. [2022-11-21 13:55:19,544 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 159.4MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:55:19,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 677.10ms. Allocated memory is still 159.4MB. Free memory was 112.4MB in the beginning and 88.8MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-21 13:55:19,544 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.17ms. Allocated memory is still 159.4MB. Free memory was 88.8MB in the beginning and 86.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 13:55:19,545 INFO L158 Benchmark]: Boogie Preprocessor took 72.55ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 13:55:19,546 INFO L158 Benchmark]: RCFGBuilder took 1058.87ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 84.7MB in the beginning and 144.4MB in the end (delta: -59.7MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2022-11-21 13:55:19,547 INFO L158 Benchmark]: TraceAbstraction took 13208.05ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 143.9MB in the beginning and 115.1MB in the end (delta: 28.9MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. [2022-11-21 13:55:19,548 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 232.8MB. Free memory was 115.1MB in the beginning and 114.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:55:19,549 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.25ms. Allocated memory is still 159.4MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 677.10ms. Allocated memory is still 159.4MB. Free memory was 112.4MB in the beginning and 88.8MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.17ms. Allocated memory is still 159.4MB. Free memory was 88.8MB in the beginning and 86.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.55ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1058.87ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 84.7MB in the beginning and 144.4MB in the end (delta: -59.7MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13208.05ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 143.9MB in the beginning and 115.1MB in the end (delta: 28.9MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 232.8MB. Free memory was 115.1MB in the beginning and 114.0MB 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: 5.7s, 135 PlacesBefore, 45 PlacesAfterwards, 127 TransitionsBefore, 36 TransitionsAfterwards, 2422 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 124 TotalNumberOfCompositions, 6391 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3141, independent: 2983, independent conditional: 0, independent unconditional: 2983, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1656, independent: 1610, independent conditional: 0, independent unconditional: 1610, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1656, independent: 1592, independent conditional: 0, independent unconditional: 1592, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 457, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 418, dependent conditional: 0, dependent unconditional: 418, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3141, independent: 1373, independent conditional: 0, independent unconditional: 1373, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 1656, unknown conditional: 0, unknown unconditional: 1656] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 166, Positive conditional cache size: 0, Positive unconditional cache size: 166, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t497; [L839] FCALL, FORK 0 pthread_create(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t497, ((void *)0), P0, ((void *)0))=-2, t497={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t498; [L841] FCALL, FORK 0 pthread_create(&t498, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t498, ((void *)0), P1, ((void *)0))=-1, t497={5:0}, t498={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t499; [L774] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L843] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __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(&t499, ((void *)0), P2, ((void *)0))=0, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t497={5:0}, t498={6:0}, t499={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L858] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 843]: 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: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 155 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 470 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 470 mSDsluCounter, 175 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1166 IncrementalHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 60 mSDtfsCounter, 1166 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1368occurred in iteration=3, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 785 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 1186 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-21 13:55:19,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/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_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/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_78ed0fcc-b4f1-4733-80e9-4ab37464001d/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 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 13:55:22,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:55:22,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:55:22,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:55:22,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:55:22,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:55:22,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:55:22,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:55:22,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:55:22,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:55:22,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:55:22,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:55:22,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:55:22,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:55:22,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:55:22,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:55:22,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:55:22,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:55:22,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:55:22,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:55:22,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:55:22,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:55:22,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:55:22,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:55:22,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:55:22,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:55:22,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:55:22,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:55:22,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:55:22,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:55:22,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:55:22,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:55:22,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:55:22,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:55:22,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:55:22,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:55:22,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:55:22,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:55:22,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:55:22,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:55:22,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:55:22,245 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-21 13:55:22,286 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:55:22,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:55:22,288 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:55:22,288 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:55:22,289 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:55:22,290 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:55:22,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:55:22,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:55:22,291 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:55:22,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:55:22,292 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:55:22,292 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:55:22,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:55:22,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:55:22,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:55:22,293 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 13:55:22,294 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 13:55:22,294 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 13:55:22,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:55:22,294 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 13:55:22,294 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-21 13:55:22,295 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-21 13:55:22,295 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:55:22,295 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:55:22,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:55:22,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:55:22,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:55:22,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:55:22,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:55:22,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:55:22,305 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-21 13:55:22,306 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-21 13:55:22,306 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-21 13:55:22,306 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_78ed0fcc-b4f1-4733-80e9-4ab37464001d/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_78ed0fcc-b4f1-4733-80e9-4ab37464001d/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 -> 3361d121b1701e03d91abe21b23341050c9e7b0bb70abe94dd0f34e8fd521162 [2022-11-21 13:55:22,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:55:22,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:55:22,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:55:22,763 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:55:22,764 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:55:22,766 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 13:55:25,918 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:55:26,274 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:55:26,274 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 13:55:26,287 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/data/fea40facb/b3d0d460b485429faa99090f1c2b0761/FLAG04cefc5ac [2022-11-21 13:55:26,303 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/data/fea40facb/b3d0d460b485429faa99090f1c2b0761 [2022-11-21 13:55:26,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:55:26,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:55:26,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:55:26,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:55:26,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:55:26,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:55:26" (1/1) ... [2022-11-21 13:55:26,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@253ff2a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:26, skipping insertion in model container [2022-11-21 13:55:26,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:55:26" (1/1) ... [2022-11-21 13:55:26,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:55:26,402 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:55:26,634 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_78ed0fcc-b4f1-4733-80e9-4ab37464001d/sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-21 13:55:26,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:55:27,006 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:55:27,050 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_78ed0fcc-b4f1-4733-80e9-4ab37464001d/sv-benchmarks/c/pthread-wmm/mix019_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-21 13:55:27,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:55:27,193 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:55:27,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:27 WrapperNode [2022-11-21 13:55:27,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:55:27,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:55:27,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:55:27,196 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:55:27,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:27" (1/1) ... [2022-11-21 13:55:27,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:27" (1/1) ... [2022-11-21 13:55:27,263 INFO L138 Inliner]: procedures = 179, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-11-21 13:55:27,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:55:27,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:55:27,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:55:27,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:55:27,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:27" (1/1) ... [2022-11-21 13:55:27,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:27" (1/1) ... [2022-11-21 13:55:27,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:27" (1/1) ... [2022-11-21 13:55:27,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:27" (1/1) ... [2022-11-21 13:55:27,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:27" (1/1) ... [2022-11-21 13:55:27,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:27" (1/1) ... [2022-11-21 13:55:27,311 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:27" (1/1) ... [2022-11-21 13:55:27,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:27" (1/1) ... [2022-11-21 13:55:27,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:55:27,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:55:27,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:55:27,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:55:27,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:27" (1/1) ... [2022-11-21 13:55:27,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:55:27,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:55:27,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:55:27,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:55:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 13:55:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:55:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 13:55:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:55:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-21 13:55:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-21 13:55:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 13:55:27,422 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 13:55:27,423 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 13:55:27,423 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 13:55:27,423 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 13:55:27,423 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 13:55:27,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 13:55:27,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:55:27,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:55:27,425 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 13:55:27,574 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:55:27,576 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:55:28,103 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:55:28,295 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:55:28,295 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 13:55:28,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:55:28 BoogieIcfgContainer [2022-11-21 13:55:28,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:55:28,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:55:28,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:55:28,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:55:28,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:55:26" (1/3) ... [2022-11-21 13:55:28,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe33a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:55:28, skipping insertion in model container [2022-11-21 13:55:28,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:27" (2/3) ... [2022-11-21 13:55:28,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe33a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:55:28, skipping insertion in model container [2022-11-21 13:55:28,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:55:28" (3/3) ... [2022-11-21 13:55:28,312 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc_pso.oepc_rmo.oepc.i [2022-11-21 13:55:28,332 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:55:28,333 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-21 13:55:28,333 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 13:55:28,423 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 13:55:28,472 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 13:55:28,504 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 128 transitions, 271 flow [2022-11-21 13:55:28,518 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 128 transitions, 271 flow [2022-11-21 13:55:28,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 128 transitions, 271 flow [2022-11-21 13:55:28,622 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-11-21 13:55:28,623 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 13:55:28,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-11-21 13:55:28,633 INFO L119 LiptonReduction]: Number of co-enabled transitions 2422 [2022-11-21 13:55:37,134 INFO L134 LiptonReduction]: Checked pairs total: 6865 [2022-11-21 13:55:37,134 INFO L136 LiptonReduction]: Total number of compositions: 120 [2022-11-21 13:55:37,143 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 36 transitions, 87 flow [2022-11-21 13:55:37,235 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:37,255 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:55:37,264 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;@303ef1fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:55:37,264 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-21 13:55:37,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:37,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 13:55:37,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:37,275 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 13:55:37,275 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 13:55:37,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:37,280 INFO L85 PathProgramCache]: Analyzing trace with hash 545, now seen corresponding path program 1 times [2022-11-21 13:55:37,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:55:37,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953599024] [2022-11-21 13:55:37,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:37,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:37,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:55:37,294 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:55:37,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-21 13:55:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:37,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-21 13:55:37,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:37,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:37,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:55:37,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:55:37,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953599024] [2022-11-21 13:55:37,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953599024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:37,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:37,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 13:55:37,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844316868] [2022-11-21 13:55:37,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:37,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 13:55:37,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:55:37,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 13:55:37,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:55:37,449 INFO L87 Difference]: Start difference. First operand has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:37,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:37,627 INFO L93 Difference]: Finished difference Result 1214 states and 3934 transitions. [2022-11-21 13:55:37,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 13:55:37,644 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-21 13:55:37,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:37,706 INFO L225 Difference]: With dead ends: 1214 [2022-11-21 13:55:37,707 INFO L226 Difference]: Without dead ends: 1214 [2022-11-21 13:55:37,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:55:37,714 INFO L413 NwaCegarLoop]: 3 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, 3 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:37,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:55:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2022-11-21 13:55:37,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2022-11-21 13:55:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1209 states have (on average 3.2539288668320925) internal successors, (3934), 1213 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3934 transitions. [2022-11-21 13:55:37,884 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3934 transitions. Word has length 1 [2022-11-21 13:55:37,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:37,885 INFO L495 AbstractCegarLoop]: Abstraction has 1214 states and 3934 transitions. [2022-11-21 13:55:37,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:37,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3934 transitions. [2022-11-21 13:55:37,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 13:55:37,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:37,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 13:55:37,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:38,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:38,098 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 13:55:38,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:38,099 INFO L85 PathProgramCache]: Analyzing trace with hash 535401, now seen corresponding path program 1 times [2022-11-21 13:55:38,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:55:38,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583604828] [2022-11-21 13:55:38,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:38,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:38,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:55:38,102 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:55:38,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-21 13:55:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:38,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 13:55:38,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:38,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:55:38,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:55:38,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583604828] [2022-11-21 13:55:38,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583604828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:38,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:38,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 13:55:38,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678784006] [2022-11-21 13:55:38,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:38,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:55:38,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:55:38,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:55:38,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:55:38,262 INFO L87 Difference]: Start difference. First operand 1214 states and 3934 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:38,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:38,412 INFO L93 Difference]: Finished difference Result 992 states and 3169 transitions. [2022-11-21 13:55:38,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:55:38,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-21 13:55:38,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:38,420 INFO L225 Difference]: With dead ends: 992 [2022-11-21 13:55:38,421 INFO L226 Difference]: Without dead ends: 962 [2022-11-21 13:55:38,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:55:38,423 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:38,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 6 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:55:38,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-11-21 13:55:38,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2022-11-21 13:55:38,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 960 states have (on average 3.21875) internal successors, (3090), 961 states have internal predecessors, (3090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 3090 transitions. [2022-11-21 13:55:38,463 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 3090 transitions. Word has length 3 [2022-11-21 13:55:38,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:38,464 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 3090 transitions. [2022-11-21 13:55:38,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 3090 transitions. [2022-11-21 13:55:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 13:55:38,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:38,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:38,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/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)] Ended with exit code 0 [2022-11-21 13:55:38,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:38,679 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 13:55:38,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:38,680 INFO L85 PathProgramCache]: Analyzing trace with hash -352238898, now seen corresponding path program 1 times [2022-11-21 13:55:38,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:55:38,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702127534] [2022-11-21 13:55:38,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:38,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:38,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:55:38,684 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:55:38,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-21 13:55:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:38,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 13:55:38,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:38,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:55:38,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:55:38,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702127534] [2022-11-21 13:55:38,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702127534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:38,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:38,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:55:38,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446904153] [2022-11-21 13:55:38,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:38,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:55:38,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:55:38,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:55:38,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:55:38,883 INFO L87 Difference]: Start difference. First operand 962 states and 3090 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:39,039 INFO L93 Difference]: Finished difference Result 712 states and 1935 transitions. [2022-11-21 13:55:39,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:55:39,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 13:55:39,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:39,043 INFO L225 Difference]: With dead ends: 712 [2022-11-21 13:55:39,043 INFO L226 Difference]: Without dead ends: 562 [2022-11-21 13:55:39,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:55:39,045 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 46 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:39,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 9 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:55:39,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-11-21 13:55:39,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2022-11-21 13:55:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 560 states have (on average 2.6607142857142856) internal successors, (1490), 561 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:39,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1490 transitions. [2022-11-21 13:55:39,070 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1490 transitions. Word has length 10 [2022-11-21 13:55:39,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:39,071 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 1490 transitions. [2022-11-21 13:55:39,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:39,071 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1490 transitions. [2022-11-21 13:55:39,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 13:55:39,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:39,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:39,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:39,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:39,286 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 13:55:39,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:39,286 INFO L85 PathProgramCache]: Analyzing trace with hash 163916534, now seen corresponding path program 1 times [2022-11-21 13:55:39,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:55:39,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938670655] [2022-11-21 13:55:39,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:39,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:39,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:55:39,292 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:55:39,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-21 13:55:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:39,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 13:55:39,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:39,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:55:39,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:55:39,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938670655] [2022-11-21 13:55:39,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938670655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:39,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:39,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:55:39,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339373744] [2022-11-21 13:55:39,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:39,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:55:39,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:55:39,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:55:39,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:55:39,476 INFO L87 Difference]: Start difference. First operand 562 states and 1490 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:39,672 INFO L93 Difference]: Finished difference Result 352 states and 831 transitions. [2022-11-21 13:55:39,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:55:39,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 13:55:39,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:39,675 INFO L225 Difference]: With dead ends: 352 [2022-11-21 13:55:39,675 INFO L226 Difference]: Without dead ends: 282 [2022-11-21 13:55:39,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:55:39,676 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 72 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:39,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 15 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:55:39,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-21 13:55:39,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-11-21 13:55:39,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 280 states have (on average 2.3214285714285716) internal successors, (650), 281 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:39,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 650 transitions. [2022-11-21 13:55:39,694 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 650 transitions. Word has length 14 [2022-11-21 13:55:39,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:39,695 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 650 transitions. [2022-11-21 13:55:39,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:39,700 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 650 transitions. [2022-11-21 13:55:39,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 13:55:39,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:39,705 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 13:55:39,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:39,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:39,927 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 13:55:39,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:39,927 INFO L85 PathProgramCache]: Analyzing trace with hash 313977478, now seen corresponding path program 1 times [2022-11-21 13:55:39,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:55:39,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529491311] [2022-11-21 13:55:39,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:39,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:39,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:55:39,929 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:55:39,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-21 13:55:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:40,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:55:40,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:40,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:40,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:55:40,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:55:40,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529491311] [2022-11-21 13:55:40,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529491311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:40,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:40,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:55:40,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577425724] [2022-11-21 13:55:40,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:40,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:55:40,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:55:40,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:55:40,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:55:40,168 INFO L87 Difference]: Start difference. First operand 282 states and 650 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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 13:55:40,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:40,414 INFO L93 Difference]: Finished difference Result 231 states and 546 transitions. [2022-11-21 13:55:40,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:55:40,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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 13:55:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:40,416 INFO L225 Difference]: With dead ends: 231 [2022-11-21 13:55:40,416 INFO L226 Difference]: Without dead ends: 217 [2022-11-21 13:55:40,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:55:40,417 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 81 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:40,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 27 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:55:40,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-21 13:55:40,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-11-21 13:55:40,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 215 states have (on average 2.4186046511627906) internal successors, (520), 216 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 520 transitions. [2022-11-21 13:55:40,429 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 520 transitions. Word has length 18 [2022-11-21 13:55:40,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:40,429 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 520 transitions. [2022-11-21 13:55:40,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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 13:55:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 520 transitions. [2022-11-21 13:55:40,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-21 13:55:40,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:40,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:40,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:40,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:40,654 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 13:55:40,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:40,654 INFO L85 PathProgramCache]: Analyzing trace with hash -414756133, now seen corresponding path program 1 times [2022-11-21 13:55:40,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:55:40,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643364734] [2022-11-21 13:55:40,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:40,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:40,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:55:40,656 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:55:40,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-21 13:55:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:40,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-21 13:55:40,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:41,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:55:41,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:55:41,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643364734] [2022-11-21 13:55:41,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643364734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:41,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:41,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:55:41,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129792311] [2022-11-21 13:55:41,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:41,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:55:41,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:55:41,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:55:41,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:55:41,149 INFO L87 Difference]: Start difference. First operand 217 states and 520 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:41,485 INFO L93 Difference]: Finished difference Result 251 states and 583 transitions. [2022-11-21 13:55:41,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:55:41,485 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-21 13:55:41,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:41,487 INFO L225 Difference]: With dead ends: 251 [2022-11-21 13:55:41,487 INFO L226 Difference]: Without dead ends: 251 [2022-11-21 13:55:41,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:55:41,488 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 57 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:41,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 33 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:55:41,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-21 13:55:41,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2022-11-21 13:55:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 248 states have (on average 2.350806451612903) internal successors, (583), 249 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:41,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 583 transitions. [2022-11-21 13:55:41,498 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 583 transitions. Word has length 23 [2022-11-21 13:55:41,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:41,498 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 583 transitions. [2022-11-21 13:55:41,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 583 transitions. [2022-11-21 13:55:41,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-21 13:55:41,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:41,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:41,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/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 13:55:41,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:41,719 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 13:55:41,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:41,720 INFO L85 PathProgramCache]: Analyzing trace with hash -414756074, now seen corresponding path program 1 times [2022-11-21 13:55:41,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:55:41,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638623951] [2022-11-21 13:55:41,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:41,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:41,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:55:41,721 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:55:41,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-21 13:55:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:41,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-21 13:55:41,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:55:42,345 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:55:42,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:55:42,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638623951] [2022-11-21 13:55:42,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638623951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:55:42,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:55:42,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:55:42,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447856667] [2022-11-21 13:55:42,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:55:42,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:55:42,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:55:42,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:55:42,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:55:42,347 INFO L87 Difference]: Start difference. First operand 250 states and 583 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:42,576 INFO L93 Difference]: Finished difference Result 249 states and 581 transitions. [2022-11-21 13:55:42,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:55:42,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-21 13:55:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:42,578 INFO L225 Difference]: With dead ends: 249 [2022-11-21 13:55:42,579 INFO L226 Difference]: Without dead ends: 162 [2022-11-21 13:55:42,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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 13:55:42,579 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 18 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.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:42,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 18 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:55:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-21 13:55:42,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-11-21 13:55:42,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.3043478260869565) internal successors, (371), 161 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 371 transitions. [2022-11-21 13:55:42,596 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 371 transitions. Word has length 23 [2022-11-21 13:55:42,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:42,596 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 371 transitions. [2022-11-21 13:55:42,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:55:42,596 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 371 transitions. [2022-11-21 13:55:42,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-21 13:55:42,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:42,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:42,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/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 13:55:42,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:42,815 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-21 13:55:42,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:42,815 INFO L85 PathProgramCache]: Analyzing trace with hash 673174323, now seen corresponding path program 2 times [2022-11-21 13:55:42,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:55:42,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925829513] [2022-11-21 13:55:42,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:55:42,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:42,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:55:42,818 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 13:55:42,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-21 13:55:42,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 13:55:42,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 13:55:42,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 13:55:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:43,139 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-21 13:55:43,140 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 13:55:43,141 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-21 13:55:43,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-21 13:55:43,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-21 13:55:43,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-21 13:55:43,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-21 13:55:43,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-21 13:55:43,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-21 13:55:43,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-21 13:55:43,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-21 13:55:43,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-21 13:55:43,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-21 13:55:43,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-21 13:55:43,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-21 13:55:43,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:43,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 13:55:43,356 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-11-21 13:55:43,361 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 13:55:43,361 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 13:55:43,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:55:43 BasicIcfg [2022-11-21 13:55:43,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 13:55:43,491 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 13:55:43,491 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 13:55:43,491 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 13:55:43,494 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:55:28" (3/4) ... [2022-11-21 13:55:43,497 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 13:55:43,497 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 13:55:43,498 INFO L158 Benchmark]: Toolchain (without parser) took 17184.59ms. Allocated memory was 71.3MB in the beginning and 130.0MB in the end (delta: 58.7MB). Free memory was 47.3MB in the beginning and 70.4MB in the end (delta: -23.1MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2022-11-21 13:55:43,498 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 71.3MB. Free memory is still 49.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:55:43,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 879.75ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 47.1MB in the beginning and 56.8MB in the end (delta: -9.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-21 13:55:43,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.34ms. Allocated memory is still 88.1MB. Free memory was 56.8MB in the beginning and 54.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 13:55:43,499 INFO L158 Benchmark]: Boogie Preprocessor took 48.67ms. Allocated memory is still 88.1MB. Free memory was 54.1MB in the beginning and 52.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 13:55:43,500 INFO L158 Benchmark]: RCFGBuilder took 983.31ms. Allocated memory is still 88.1MB. Free memory was 52.0MB in the beginning and 57.0MB in the end (delta: -5.1MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-11-21 13:55:43,500 INFO L158 Benchmark]: TraceAbstraction took 15187.31ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 56.2MB in the beginning and 70.4MB in the end (delta: -14.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-21 13:55:43,501 INFO L158 Benchmark]: Witness Printer took 6.62ms. Allocated memory is still 130.0MB. Free memory was 70.4MB in the beginning and 70.4MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 13:55:43,503 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.32ms. Allocated memory is still 71.3MB. Free memory is still 49.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 879.75ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 47.1MB in the beginning and 56.8MB in the end (delta: -9.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.34ms. Allocated memory is still 88.1MB. Free memory was 56.8MB in the beginning and 54.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.67ms. Allocated memory is still 88.1MB. Free memory was 54.1MB in the beginning and 52.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 983.31ms. Allocated memory is still 88.1MB. Free memory was 52.0MB in the beginning and 57.0MB in the end (delta: -5.1MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15187.31ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 56.2MB in the beginning and 70.4MB in the end (delta: -14.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Witness Printer took 6.62ms. Allocated memory is still 130.0MB. Free memory was 70.4MB in the beginning and 70.4MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.6s, 136 PlacesBefore, 45 PlacesAfterwards, 128 TransitionsBefore, 36 TransitionsAfterwards, 2422 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 6865 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3329, independent: 3141, independent conditional: 0, independent unconditional: 3141, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1642, independent: 1595, independent conditional: 0, independent unconditional: 1595, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1642, independent: 1577, independent conditional: 0, independent unconditional: 1577, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 413, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 381, dependent conditional: 0, dependent unconditional: 381, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3329, independent: 1546, independent conditional: 0, independent unconditional: 1546, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 1642, unknown conditional: 0, unknown unconditional: 1642] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 161, Positive conditional cache size: 0, Positive unconditional cache size: 161, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t497; [L839] FCALL, FORK 0 pthread_create(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t497, ((void *)0), P0, ((void *)0))=0, t497={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t498; [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t498, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t498, ((void *)0), P1, ((void *)0))=1, t497={-6:0}, t498={-10:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t499; [L774] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __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(&t499, ((void *)0), P2, ((void *)0))=2, t497={-6:0}, t498={-10:0}, t499={-2:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t497={-6:0}, t498={-10:0}, t499={-2:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t497={-6:0}, t498={-10:0}, t499={-2:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 843]: 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: 841]: 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: 839]: 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, 156 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 284 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 284 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 653 IncrementalHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 38 mSDtfsCounter, 653 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1288occurred in iteration=0, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 85 ConstructedInterpolants, 15 QuantifiedInterpolants, 1072 SizeOfPredicates, 14 NumberOfNonLiveVariables, 788 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-21 13:55:43,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78ed0fcc-b4f1-4733-80e9-4ab37464001d/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