./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe014_power.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_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/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_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/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_9c7fa509-58e9-4a34-813e-b42de524a3d0/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 7ff9a02e3a4860dd4559a47ff1369af4fea93a232a0eb144fdecc9bc5971fe5b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:09:16,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:09:16,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:09:16,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:09:16,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:09:16,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:09:16,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:09:16,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:09:16,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:09:16,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:09:16,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:09:16,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:09:16,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:09:16,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:09:16,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:09:16,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:09:16,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:09:16,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:09:16,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:09:16,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:09:16,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:09:16,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:09:16,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:09:16,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:09:16,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:09:16,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:09:16,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:09:16,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:09:16,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:09:16,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:09:16,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:09:16,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:09:16,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:09:16,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:09:16,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:09:16,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:09:16,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:09:16,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:09:16,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:09:16,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:09:16,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:09:16,698 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 16:09:16,734 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:09:16,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:09:16,744 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:09:16,744 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:09:16,745 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:09:16,745 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:09:16,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:09:16,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:09:16,747 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:09:16,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:09:16,748 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:09:16,748 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:09:16,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:09:16,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:09:16,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:09:16,749 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 16:09:16,749 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 16:09:16,749 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 16:09:16,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:09:16,750 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:09:16,750 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:09:16,750 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:09:16,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:09:16,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:09:16,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:09:16,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:09:16,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:09:16,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:09:16,753 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:09:16,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:09:16,753 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_9c7fa509-58e9-4a34-813e-b42de524a3d0/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_9c7fa509-58e9-4a34-813e-b42de524a3d0/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 -> 7ff9a02e3a4860dd4559a47ff1369af4fea93a232a0eb144fdecc9bc5971fe5b [2022-11-21 16:09:17,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:09:17,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:09:17,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:09:17,126 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:09:17,127 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:09:17,129 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i [2022-11-21 16:09:20,391 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:09:20,728 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:09:20,741 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i [2022-11-21 16:09:20,766 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/data/bbf5e4862/8ff040bea991406f94dcb6caf979db5c/FLAG4d881e325 [2022-11-21 16:09:20,781 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/data/bbf5e4862/8ff040bea991406f94dcb6caf979db5c [2022-11-21 16:09:20,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:09:20,786 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:09:20,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:09:20,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:09:20,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:09:20,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:09:20" (1/1) ... [2022-11-21 16:09:20,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da72046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:20, skipping insertion in model container [2022-11-21 16:09:20,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:09:20" (1/1) ... [2022-11-21 16:09:20,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:09:20,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:09:21,166 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_9c7fa509-58e9-4a34-813e-b42de524a3d0/sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i[995,1008] [2022-11-21 16:09:21,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:09:21,549 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:09:21,565 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_9c7fa509-58e9-4a34-813e-b42de524a3d0/sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i[995,1008] [2022-11-21 16:09:21,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:09:21,705 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:09:21,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:21 WrapperNode [2022-11-21 16:09:21,708 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:09:21,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:09:21,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:09:21,711 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:09:21,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:21" (1/1) ... [2022-11-21 16:09:21,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:21" (1/1) ... [2022-11-21 16:09:21,808 INFO L138 Inliner]: procedures = 176, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-11-21 16:09:21,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:09:21,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:09:21,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:09:21,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:09:21,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:21" (1/1) ... [2022-11-21 16:09:21,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:21" (1/1) ... [2022-11-21 16:09:21,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:21" (1/1) ... [2022-11-21 16:09:21,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:21" (1/1) ... [2022-11-21 16:09:21,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:21" (1/1) ... [2022-11-21 16:09:21,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:21" (1/1) ... [2022-11-21 16:09:21,872 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:21" (1/1) ... [2022-11-21 16:09:21,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:21" (1/1) ... [2022-11-21 16:09:21,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:09:21,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:09:21,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:09:21,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:09:21,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:21" (1/1) ... [2022-11-21 16:09:21,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:09:21,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:09:21,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:09:21,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:09:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:09:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:09:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:09:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:09:21,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:09:21,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:09:21,991 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 16:09:21,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 16:09:21,992 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 16:09:21,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 16:09:21,992 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 16:09:21,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 16:09:21,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:09:21,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:09:21,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:09:21,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:09:21,995 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:09:22,160 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:09:22,164 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:09:22,960 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:09:23,519 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:09:23,519 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:09:23,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:09:23 BoogieIcfgContainer [2022-11-21 16:09:23,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:09:23,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:09:23,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:09:23,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:09:23,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:09:20" (1/3) ... [2022-11-21 16:09:23,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbfd820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:09:23, skipping insertion in model container [2022-11-21 16:09:23,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:09:21" (2/3) ... [2022-11-21 16:09:23,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbfd820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:09:23, skipping insertion in model container [2022-11-21 16:09:23,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:09:23" (3/3) ... [2022-11-21 16:09:23,536 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_power.oepc.i [2022-11-21 16:09:23,563 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:09:23,563 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2022-11-21 16:09:23,564 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:09:23,731 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 16:09:23,792 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 16:09:23,818 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 169 transitions, 353 flow [2022-11-21 16:09:23,823 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 169 transitions, 353 flow [2022-11-21 16:09:23,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 169 transitions, 353 flow [2022-11-21 16:09:23,960 INFO L130 PetriNetUnfolder]: 2/166 cut-off events. [2022-11-21 16:09:23,960 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:09:23,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 166 events. 2/166 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 215 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2022-11-21 16:09:23,976 INFO L119 LiptonReduction]: Number of co-enabled transitions 5336 [2022-11-21 16:09:48,321 INFO L134 LiptonReduction]: Checked pairs total: 18429 [2022-11-21 16:09:48,322 INFO L136 LiptonReduction]: Total number of compositions: 171 [2022-11-21 16:09:48,331 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 64 transitions, 143 flow [2022-11-21 16:09:48,875 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 13680 states, 12540 states have (on average 3.893859649122807) internal successors, (48829), 13679 states have internal predecessors, (48829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:48,899 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:09:48,907 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;@542cca2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:09:48,907 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2022-11-21 16:09:48,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 13680 states, 12540 states have (on average 3.893859649122807) internal successors, (48829), 13679 states have internal predecessors, (48829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:48,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 16:09:48,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:48,948 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 16:09:48,949 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:09:48,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:48,955 INFO L85 PathProgramCache]: Analyzing trace with hash 951, now seen corresponding path program 1 times [2022-11-21 16:09:48,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:48,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123843969] [2022-11-21 16:09:48,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:48,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:49,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:49,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123843969] [2022-11-21 16:09:49,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123843969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:49,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:49,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 16:09:49,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911676770] [2022-11-21 16:09:49,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:49,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:09:49,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:49,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:09:49,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:09:49,166 INFO L87 Difference]: Start difference. First operand has 13680 states, 12540 states have (on average 3.893859649122807) internal successors, (48829), 13679 states have internal predecessors, (48829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:49,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:49,389 INFO L93 Difference]: Finished difference Result 3308 states and 11165 transitions. [2022-11-21 16:09:49,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:09:49,392 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-21 16:09:49,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:49,433 INFO L225 Difference]: With dead ends: 3308 [2022-11-21 16:09:49,434 INFO L226 Difference]: Without dead ends: 3308 [2022-11-21 16:09:49,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:09:49,438 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:49,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:09:49,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2022-11-21 16:09:49,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 3308. [2022-11-21 16:09:49,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3308 states, 3174 states have (on average 3.517643352236925) internal successors, (11165), 3307 states have internal predecessors, (11165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:49,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 11165 transitions. [2022-11-21 16:09:49,672 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 11165 transitions. Word has length 1 [2022-11-21 16:09:49,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:49,673 INFO L495 AbstractCegarLoop]: Abstraction has 3308 states and 11165 transitions. [2022-11-21 16:09:49,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:49,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 11165 transitions. [2022-11-21 16:09:49,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 16:09:49,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:49,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 16:09:49,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:09:49,675 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:09:49,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:49,676 INFO L85 PathProgramCache]: Analyzing trace with hash 936892, now seen corresponding path program 1 times [2022-11-21 16:09:49,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:49,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402479360] [2022-11-21 16:09:49,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:49,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:50,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:50,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:50,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402479360] [2022-11-21 16:09:50,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402479360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:50,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:50,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:09:50,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825647494] [2022-11-21 16:09:50,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:50,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:09:50,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:50,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:09:50,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:50,193 INFO L87 Difference]: Start difference. First operand 3308 states and 11165 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:50,312 INFO L93 Difference]: Finished difference Result 2133 states and 7056 transitions. [2022-11-21 16:09:50,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:09:50,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-21 16:09:50,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:50,331 INFO L225 Difference]: With dead ends: 2133 [2022-11-21 16:09:50,332 INFO L226 Difference]: Without dead ends: 2133 [2022-11-21 16:09:50,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:50,340 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:50,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:09:50,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2022-11-21 16:09:50,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 2133. [2022-11-21 16:09:50,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 2078 states have (on average 3.395572666025024) internal successors, (7056), 2132 states have internal predecessors, (7056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:50,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 7056 transitions. [2022-11-21 16:09:50,447 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 7056 transitions. Word has length 3 [2022-11-21 16:09:50,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:50,447 INFO L495 AbstractCegarLoop]: Abstraction has 2133 states and 7056 transitions. [2022-11-21 16:09:50,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:50,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 7056 transitions. [2022-11-21 16:09:50,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 16:09:50,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:50,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 16:09:50,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:09:50,450 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:09:50,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:50,452 INFO L85 PathProgramCache]: Analyzing trace with hash 936891, now seen corresponding path program 1 times [2022-11-21 16:09:50,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:50,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870613253] [2022-11-21 16:09:50,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:50,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:50,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:50,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870613253] [2022-11-21 16:09:50,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870613253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:50,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:50,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:09:50,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026722670] [2022-11-21 16:09:50,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:50,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:09:50,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:50,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:09:50,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:50,584 INFO L87 Difference]: Start difference. First operand 2133 states and 7056 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:50,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:50,709 INFO L93 Difference]: Finished difference Result 1238 states and 3933 transitions. [2022-11-21 16:09:50,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:09:50,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-21 16:09:50,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:50,720 INFO L225 Difference]: With dead ends: 1238 [2022-11-21 16:09:50,720 INFO L226 Difference]: Without dead ends: 1238 [2022-11-21 16:09:50,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:50,721 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:50,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 6 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:09:50,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2022-11-21 16:09:50,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1238. [2022-11-21 16:09:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1220 states have (on average 3.2237704918032786) internal successors, (3933), 1237 states have internal predecessors, (3933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 3933 transitions. [2022-11-21 16:09:50,774 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 3933 transitions. Word has length 3 [2022-11-21 16:09:50,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:50,775 INFO L495 AbstractCegarLoop]: Abstraction has 1238 states and 3933 transitions. [2022-11-21 16:09:50,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:50,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 3933 transitions. [2022-11-21 16:09:50,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 16:09:50,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:50,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:50,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:09:50,777 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:09:50,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:50,778 INFO L85 PathProgramCache]: Analyzing trace with hash 720642535, now seen corresponding path program 1 times [2022-11-21 16:09:50,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:50,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477034827] [2022-11-21 16:09:50,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:50,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:51,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:51,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:51,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477034827] [2022-11-21 16:09:51,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477034827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:51,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:51,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:09:51,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575578992] [2022-11-21 16:09:51,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:51,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:09:51,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:51,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:09:51,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:51,064 INFO L87 Difference]: Start difference. First operand 1238 states and 3933 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:51,193 INFO L93 Difference]: Finished difference Result 1198 states and 3791 transitions. [2022-11-21 16:09:51,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:09:51,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 16:09:51,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:51,262 INFO L225 Difference]: With dead ends: 1198 [2022-11-21 16:09:51,262 INFO L226 Difference]: Without dead ends: 1198 [2022-11-21 16:09:51,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:51,266 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:51,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 10 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:09:51,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2022-11-21 16:09:51,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2022-11-21 16:09:51,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1180 states have (on average 3.2127118644067796) internal successors, (3791), 1197 states have internal predecessors, (3791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:51,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 3791 transitions. [2022-11-21 16:09:51,316 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 3791 transitions. Word has length 10 [2022-11-21 16:09:51,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:51,318 INFO L495 AbstractCegarLoop]: Abstraction has 1198 states and 3791 transitions. [2022-11-21 16:09:51,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 3791 transitions. [2022-11-21 16:09:51,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 16:09:51,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:51,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:51,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:09:51,322 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:09:51,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash 865078821, now seen corresponding path program 1 times [2022-11-21 16:09:51,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:51,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124308987] [2022-11-21 16:09:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:51,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:51,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:51,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124308987] [2022-11-21 16:09:51,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124308987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:51,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:51,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:09:51,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485319544] [2022-11-21 16:09:51,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:51,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:09:51,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:51,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:09:51,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:51,645 INFO L87 Difference]: Start difference. First operand 1198 states and 3791 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:51,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:51,772 INFO L93 Difference]: Finished difference Result 1194 states and 3776 transitions. [2022-11-21 16:09:51,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:09:51,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-21 16:09:51,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:51,782 INFO L225 Difference]: With dead ends: 1194 [2022-11-21 16:09:51,782 INFO L226 Difference]: Without dead ends: 1194 [2022-11-21 16:09:51,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:51,784 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:51,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 10 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:09:51,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2022-11-21 16:09:51,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1194. [2022-11-21 16:09:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1176 states have (on average 3.2108843537414966) internal successors, (3776), 1193 states have internal predecessors, (3776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 3776 transitions. [2022-11-21 16:09:51,830 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 3776 transitions. Word has length 11 [2022-11-21 16:09:51,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:51,830 INFO L495 AbstractCegarLoop]: Abstraction has 1194 states and 3776 transitions. [2022-11-21 16:09:51,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 3776 transitions. [2022-11-21 16:09:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 16:09:51,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:51,834 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:51,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:09:51,835 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:09:51,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:51,836 INFO L85 PathProgramCache]: Analyzing trace with hash 865082589, now seen corresponding path program 1 times [2022-11-21 16:09:51,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:51,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667058466] [2022-11-21 16:09:51,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:51,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:52,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:52,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:52,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667058466] [2022-11-21 16:09:52,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667058466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:52,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:52,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:09:52,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086462309] [2022-11-21 16:09:52,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:52,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:09:52,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:52,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:09:52,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:52,016 INFO L87 Difference]: Start difference. First operand 1194 states and 3776 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:52,167 INFO L93 Difference]: Finished difference Result 1494 states and 4525 transitions. [2022-11-21 16:09:52,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:09:52,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-21 16:09:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:52,177 INFO L225 Difference]: With dead ends: 1494 [2022-11-21 16:09:52,177 INFO L226 Difference]: Without dead ends: 1458 [2022-11-21 16:09:52,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:52,178 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:52,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 8 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:09:52,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2022-11-21 16:09:52,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1242. [2022-11-21 16:09:52,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1225 states have (on average 3.216326530612245) internal successors, (3940), 1241 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 3940 transitions. [2022-11-21 16:09:52,226 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 3940 transitions. Word has length 11 [2022-11-21 16:09:52,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:52,227 INFO L495 AbstractCegarLoop]: Abstraction has 1242 states and 3940 transitions. [2022-11-21 16:09:52,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:52,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 3940 transitions. [2022-11-21 16:09:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 16:09:52,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:52,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:52,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:09:52,229 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:09:52,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:52,229 INFO L85 PathProgramCache]: Analyzing trace with hash 865082590, now seen corresponding path program 1 times [2022-11-21 16:09:52,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:52,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661463942] [2022-11-21 16:09:52,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:52,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:52,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:52,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661463942] [2022-11-21 16:09:52,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661463942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:52,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:52,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:09:52,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563886107] [2022-11-21 16:09:52,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:52,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:09:52,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:52,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:09:52,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:09:52,511 INFO L87 Difference]: Start difference. First operand 1242 states and 3940 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 16:09:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:52,693 INFO L93 Difference]: Finished difference Result 1944 states and 6088 transitions. [2022-11-21 16:09:52,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:09:52,693 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 16:09:52,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:52,707 INFO L225 Difference]: With dead ends: 1944 [2022-11-21 16:09:52,707 INFO L226 Difference]: Without dead ends: 1944 [2022-11-21 16:09:52,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:09:52,709 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:52,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 9 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:09:52,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2022-11-21 16:09:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1386. [2022-11-21 16:09:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1369 states have (on average 3.2023374726077427) internal successors, (4384), 1385 states have internal predecessors, (4384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 4384 transitions. [2022-11-21 16:09:52,762 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 4384 transitions. Word has length 11 [2022-11-21 16:09:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:52,762 INFO L495 AbstractCegarLoop]: Abstraction has 1386 states and 4384 transitions. [2022-11-21 16:09:52,762 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 16:09:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 4384 transitions. [2022-11-21 16:09:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 16:09:52,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:52,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:52,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:09:52,764 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:09:52,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:52,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1009042250, now seen corresponding path program 2 times [2022-11-21 16:09:52,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:52,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638053019] [2022-11-21 16:09:52,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:52,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:53,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:53,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638053019] [2022-11-21 16:09:53,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638053019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:53,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:53,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:09:53,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936587948] [2022-11-21 16:09:53,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:53,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:09:53,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:53,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:09:53,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:09:53,212 INFO L87 Difference]: Start difference. First operand 1386 states and 4384 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:53,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:53,393 INFO L93 Difference]: Finished difference Result 1542 states and 4689 transitions. [2022-11-21 16:09:53,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:09:53,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-21 16:09:53,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:53,404 INFO L225 Difference]: With dead ends: 1542 [2022-11-21 16:09:53,405 INFO L226 Difference]: Without dead ends: 1542 [2022-11-21 16:09:53,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:09:53,406 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:53,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 10 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:09:53,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2022-11-21 16:09:53,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1182. [2022-11-21 16:09:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1166 states have (on average 3.213550600343053) internal successors, (3747), 1181 states have internal predecessors, (3747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 3747 transitions. [2022-11-21 16:09:53,454 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 3747 transitions. Word has length 11 [2022-11-21 16:09:53,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:53,455 INFO L495 AbstractCegarLoop]: Abstraction has 1182 states and 3747 transitions. [2022-11-21 16:09:53,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:53,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 3747 transitions. [2022-11-21 16:09:53,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 16:09:53,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:53,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:53,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:09:53,456 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:09:53,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:53,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1043405635, now seen corresponding path program 1 times [2022-11-21 16:09:53,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:53,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554389966] [2022-11-21 16:09:53,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:53,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:53,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:53,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:53,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554389966] [2022-11-21 16:09:53,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554389966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:53,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:53,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:09:53,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476313862] [2022-11-21 16:09:53,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:53,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:09:53,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:53,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:09:53,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:09:53,656 INFO L87 Difference]: Start difference. First operand 1182 states and 3747 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 16:09:53,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:53,801 INFO L93 Difference]: Finished difference Result 1802 states and 5657 transitions. [2022-11-21 16:09:53,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:09:53,801 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 16:09:53,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:53,812 INFO L225 Difference]: With dead ends: 1802 [2022-11-21 16:09:53,812 INFO L226 Difference]: Without dead ends: 1802 [2022-11-21 16:09:53,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:09:53,813 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 61 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:53,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 14 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:09:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2022-11-21 16:09:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1298. [2022-11-21 16:09:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1282 states have (on average 3.202808112324493) internal successors, (4106), 1297 states have internal predecessors, (4106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 4106 transitions. [2022-11-21 16:09:53,875 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 4106 transitions. Word has length 12 [2022-11-21 16:09:53,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:53,876 INFO L495 AbstractCegarLoop]: Abstraction has 1298 states and 4106 transitions. [2022-11-21 16:09:53,876 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 16:09:53,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 4106 transitions. [2022-11-21 16:09:53,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 16:09:53,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:53,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:53,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:09:53,878 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:09:53,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:53,879 INFO L85 PathProgramCache]: Analyzing trace with hash -827055633, now seen corresponding path program 1 times [2022-11-21 16:09:53,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:53,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091237919] [2022-11-21 16:09:53,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:53,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:54,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:54,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091237919] [2022-11-21 16:09:54,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091237919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:54,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:54,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:09:54,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535833412] [2022-11-21 16:09:54,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:54,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:09:54,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:54,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:09:54,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:09:54,136 INFO L87 Difference]: Start difference. First operand 1298 states and 4106 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:54,374 INFO L93 Difference]: Finished difference Result 1882 states and 5889 transitions. [2022-11-21 16:09:54,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:09:54,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-21 16:09:54,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:54,385 INFO L225 Difference]: With dead ends: 1882 [2022-11-21 16:09:54,385 INFO L226 Difference]: Without dead ends: 1882 [2022-11-21 16:09:54,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:09:54,386 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 58 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:54,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 24 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:09:54,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-11-21 16:09:54,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1234. [2022-11-21 16:09:54,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1218 states have (on average 3.187192118226601) internal successors, (3882), 1233 states have internal predecessors, (3882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:54,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 3882 transitions. [2022-11-21 16:09:54,436 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 3882 transitions. Word has length 13 [2022-11-21 16:09:54,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:54,436 INFO L495 AbstractCegarLoop]: Abstraction has 1234 states and 3882 transitions. [2022-11-21 16:09:54,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 3882 transitions. [2022-11-21 16:09:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 16:09:54,438 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:54,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:54,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:09:54,438 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:09:54,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:54,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1882902544, now seen corresponding path program 1 times [2022-11-21 16:09:54,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:54,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049563489] [2022-11-21 16:09:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:54,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:54,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:54,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049563489] [2022-11-21 16:09:54,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049563489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:54,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:54,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:09:54,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450430067] [2022-11-21 16:09:54,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:54,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:09:54,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:54,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:09:54,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:09:54,640 INFO L87 Difference]: Start difference. First operand 1234 states and 3882 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:54,772 INFO L93 Difference]: Finished difference Result 1418 states and 4212 transitions. [2022-11-21 16:09:54,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:09:54,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-21 16:09:54,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:54,780 INFO L225 Difference]: With dead ends: 1418 [2022-11-21 16:09:54,780 INFO L226 Difference]: Without dead ends: 1394 [2022-11-21 16:09:54,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:09:54,781 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 31 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:54,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 9 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:09:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2022-11-21 16:09:54,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1154. [2022-11-21 16:09:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1138 states have (on average 3.133567662565905) internal successors, (3566), 1153 states have internal predecessors, (3566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:54,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 3566 transitions. [2022-11-21 16:09:54,822 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 3566 transitions. Word has length 13 [2022-11-21 16:09:54,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:54,823 INFO L495 AbstractCegarLoop]: Abstraction has 1154 states and 3566 transitions. [2022-11-21 16:09:54,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:54,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 3566 transitions. [2022-11-21 16:09:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:09:54,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:54,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:54,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:09:54,825 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:09:54,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:54,826 INFO L85 PathProgramCache]: Analyzing trace with hash -456820159, now seen corresponding path program 1 times [2022-11-21 16:09:54,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:54,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746664613] [2022-11-21 16:09:54,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:54,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:55,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746664613] [2022-11-21 16:09:55,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746664613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:55,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:55,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:09:55,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126087134] [2022-11-21 16:09:55,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:55,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:09:55,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:55,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:09:55,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:55,136 INFO L87 Difference]: Start difference. First operand 1154 states and 3566 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:55,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:55,259 INFO L93 Difference]: Finished difference Result 1146 states and 3540 transitions. [2022-11-21 16:09:55,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:09:55,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 16:09:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:55,266 INFO L225 Difference]: With dead ends: 1146 [2022-11-21 16:09:55,266 INFO L226 Difference]: Without dead ends: 1146 [2022-11-21 16:09:55,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:55,267 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:55,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 10 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:09:55,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2022-11-21 16:09:55,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1146. [2022-11-21 16:09:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1130 states have (on average 3.1327433628318584) internal successors, (3540), 1145 states have internal predecessors, (3540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:55,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 3540 transitions. [2022-11-21 16:09:55,306 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 3540 transitions. Word has length 14 [2022-11-21 16:09:55,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:55,306 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 3540 transitions. [2022-11-21 16:09:55,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:55,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 3540 transitions. [2022-11-21 16:09:55,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:09:55,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:55,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:55,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 16:09:55,309 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:09:55,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:55,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1759560453, now seen corresponding path program 1 times [2022-11-21 16:09:55,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:55,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859672715] [2022-11-21 16:09:55,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:55,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:56,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:56,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859672715] [2022-11-21 16:09:56,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859672715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:56,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:56,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:09:56,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257673274] [2022-11-21 16:09:56,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:56,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:09:56,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:56,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:09:56,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:09:56,103 INFO L87 Difference]: Start difference. First operand 1146 states and 3540 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:56,700 INFO L93 Difference]: Finished difference Result 1570 states and 4810 transitions. [2022-11-21 16:09:56,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:09:56,702 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 16:09:56,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:56,708 INFO L225 Difference]: With dead ends: 1570 [2022-11-21 16:09:56,708 INFO L226 Difference]: Without dead ends: 1426 [2022-11-21 16:09:56,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:09:56,709 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 61 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:56,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 54 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:09:56,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2022-11-21 16:09:56,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1402. [2022-11-21 16:09:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1390 states have (on average 3.033093525179856) internal successors, (4216), 1401 states have internal predecessors, (4216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 4216 transitions. [2022-11-21 16:09:56,750 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 4216 transitions. Word has length 14 [2022-11-21 16:09:56,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:56,750 INFO L495 AbstractCegarLoop]: Abstraction has 1402 states and 4216 transitions. [2022-11-21 16:09:56,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:56,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 4216 transitions. [2022-11-21 16:09:56,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:09:56,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:56,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:56,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:09:56,753 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:09:56,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:56,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1759560406, now seen corresponding path program 1 times [2022-11-21 16:09:56,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:56,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830007575] [2022-11-21 16:09:56,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:56,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:56,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:56,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830007575] [2022-11-21 16:09:56,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830007575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:56,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:56,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:09:56,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161274225] [2022-11-21 16:09:56,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:56,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:09:56,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:56,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:09:56,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:56,922 INFO L87 Difference]: Start difference. First operand 1402 states and 4216 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:57,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:57,016 INFO L93 Difference]: Finished difference Result 859 states and 2160 transitions. [2022-11-21 16:09:57,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:09:57,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 16:09:57,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:57,020 INFO L225 Difference]: With dead ends: 859 [2022-11-21 16:09:57,020 INFO L226 Difference]: Without dead ends: 859 [2022-11-21 16:09:57,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:09:57,021 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:57,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 10 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:09:57,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2022-11-21 16:09:57,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2022-11-21 16:09:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 847 states have (on average 2.550177095631641) internal successors, (2160), 858 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 2160 transitions. [2022-11-21 16:09:57,048 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 2160 transitions. Word has length 14 [2022-11-21 16:09:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:57,049 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 2160 transitions. [2022-11-21 16:09:57,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 2160 transitions. [2022-11-21 16:09:57,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 16:09:57,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:57,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:57,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 16:09:57,052 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:09:57,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:57,053 INFO L85 PathProgramCache]: Analyzing trace with hash -970266358, now seen corresponding path program 1 times [2022-11-21 16:09:57,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:57,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816337157] [2022-11-21 16:09:57,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:57,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:09:59,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:09:59,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:09:59,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816337157] [2022-11-21 16:09:59,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816337157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:09:59,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:09:59,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:09:59,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629831319] [2022-11-21 16:09:59,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:09:59,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:09:59,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:09:59,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:09:59,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:09:59,211 INFO L87 Difference]: Start difference. First operand 859 states and 2160 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:59,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:09:59,734 INFO L93 Difference]: Finished difference Result 1038 states and 2605 transitions. [2022-11-21 16:09:59,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:09:59,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 16:09:59,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:09:59,738 INFO L225 Difference]: With dead ends: 1038 [2022-11-21 16:09:59,738 INFO L226 Difference]: Without dead ends: 1032 [2022-11-21 16:09:59,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2022-11-21 16:09:59,739 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 107 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:09:59,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 30 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:09:59,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2022-11-21 16:09:59,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 909. [2022-11-21 16:09:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 897 states have (on average 2.5540691192865106) internal successors, (2291), 908 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:59,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 2291 transitions. [2022-11-21 16:09:59,777 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 2291 transitions. Word has length 16 [2022-11-21 16:09:59,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:09:59,778 INFO L495 AbstractCegarLoop]: Abstraction has 909 states and 2291 transitions. [2022-11-21 16:09:59,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:09:59,778 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 2291 transitions. [2022-11-21 16:09:59,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 16:09:59,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:09:59,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:09:59,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 16:09:59,780 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:09:59,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:09:59,781 INFO L85 PathProgramCache]: Analyzing trace with hash -238958970, now seen corresponding path program 2 times [2022-11-21 16:09:59,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:09:59,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150426887] [2022-11-21 16:09:59,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:09:59,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:09:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:10:01,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:01,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150426887] [2022-11-21 16:10:01,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150426887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:10:01,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:10:01,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:10:01,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494430952] [2022-11-21 16:10:01,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:10:01,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:10:01,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:01,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:10:01,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:10:01,666 INFO L87 Difference]: Start difference. First operand 909 states and 2291 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:02,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:02,522 INFO L93 Difference]: Finished difference Result 920 states and 2301 transitions. [2022-11-21 16:10:02,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 16:10:02,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 16:10:02,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:02,526 INFO L225 Difference]: With dead ends: 920 [2022-11-21 16:10:02,527 INFO L226 Difference]: Without dead ends: 920 [2022-11-21 16:10:02,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:10:02,528 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 78 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:02,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 34 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:10:02,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2022-11-21 16:10:02,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 855. [2022-11-21 16:10:02,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 843 states have (on average 2.5373665480427046) internal successors, (2139), 854 states have internal predecessors, (2139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 2139 transitions. [2022-11-21 16:10:02,569 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 2139 transitions. Word has length 16 [2022-11-21 16:10:02,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:02,570 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 2139 transitions. [2022-11-21 16:10:02,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:02,570 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 2139 transitions. [2022-11-21 16:10:02,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 16:10:02,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:02,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:02,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 16:10:02,572 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:10:02,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:02,574 INFO L85 PathProgramCache]: Analyzing trace with hash -13490302, now seen corresponding path program 1 times [2022-11-21 16:10:02,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:02,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204253445] [2022-11-21 16:10:02,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:02,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:02,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:10:02,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:02,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204253445] [2022-11-21 16:10:02,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204253445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:10:02,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:10:02,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:10:02,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092773811] [2022-11-21 16:10:02,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:10:02,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:10:02,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:02,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:10:02,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:10:02,842 INFO L87 Difference]: Start difference. First operand 855 states and 2139 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:02,958 INFO L93 Difference]: Finished difference Result 395 states and 826 transitions. [2022-11-21 16:10:02,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:10:02,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 16:10:02,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:02,960 INFO L225 Difference]: With dead ends: 395 [2022-11-21 16:10:02,960 INFO L226 Difference]: Without dead ends: 395 [2022-11-21 16:10:02,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:10:02,961 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:02,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 15 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:10:02,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-11-21 16:10:02,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2022-11-21 16:10:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 386 states have (on average 2.139896373056995) internal successors, (826), 394 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 826 transitions. [2022-11-21 16:10:02,974 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 826 transitions. Word has length 17 [2022-11-21 16:10:02,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:02,974 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 826 transitions. [2022-11-21 16:10:02,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 826 transitions. [2022-11-21 16:10:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:10:02,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:02,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:02,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 16:10:02,977 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:10:02,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:02,978 INFO L85 PathProgramCache]: Analyzing trace with hash 724770393, now seen corresponding path program 1 times [2022-11-21 16:10:02,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:02,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976313282] [2022-11-21 16:10:02,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:02,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:10:03,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:03,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976313282] [2022-11-21 16:10:03,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976313282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:10:03,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:10:03,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:10:03,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681286810] [2022-11-21 16:10:03,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:10:03,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:10:03,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:03,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:10:03,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:10:03,312 INFO L87 Difference]: Start difference. First operand 395 states and 826 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:03,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:03,422 INFO L93 Difference]: Finished difference Result 269 states and 575 transitions. [2022-11-21 16:10:03,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:10:03,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-21 16:10:03,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:03,424 INFO L225 Difference]: With dead ends: 269 [2022-11-21 16:10:03,424 INFO L226 Difference]: Without dead ends: 229 [2022-11-21 16:10:03,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:10:03,425 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 41 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:03,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 12 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:10:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-11-21 16:10:03,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2022-11-21 16:10:03,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 227 states have (on average 2.154185022026432) internal successors, (489), 228 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:03,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 489 transitions. [2022-11-21 16:10:03,434 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 489 transitions. Word has length 19 [2022-11-21 16:10:03,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:03,435 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 489 transitions. [2022-11-21 16:10:03,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:03,435 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 489 transitions. [2022-11-21 16:10:03,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:10:03,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:03,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:03,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 16:10:03,437 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:10:03,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:03,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1969408915, now seen corresponding path program 1 times [2022-11-21 16:10:03,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:03,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383698429] [2022-11-21 16:10:03,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:03,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:03,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:10:03,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:03,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383698429] [2022-11-21 16:10:03,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383698429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:10:03,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:10:03,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:10:03,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713018156] [2022-11-21 16:10:03,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:10:03,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:10:03,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:03,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:10:03,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:10:03,745 INFO L87 Difference]: Start difference. First operand 229 states and 489 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:03,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:03,872 INFO L93 Difference]: Finished difference Result 315 states and 640 transitions. [2022-11-21 16:10:03,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:10:03,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-21 16:10:03,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:03,874 INFO L225 Difference]: With dead ends: 315 [2022-11-21 16:10:03,874 INFO L226 Difference]: Without dead ends: 257 [2022-11-21 16:10:03,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:10:03,875 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 30 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:03,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 11 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:10:03,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-11-21 16:10:03,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 209. [2022-11-21 16:10:03,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 207 states have (on average 2.072463768115942) internal successors, (429), 208 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:03,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 429 transitions. [2022-11-21 16:10:03,882 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 429 transitions. Word has length 21 [2022-11-21 16:10:03,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:03,883 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 429 transitions. [2022-11-21 16:10:03,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:03,883 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 429 transitions. [2022-11-21 16:10:03,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:10:03,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:03,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:03,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 16:10:03,885 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:10:03,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:03,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1759092377, now seen corresponding path program 2 times [2022-11-21 16:10:03,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:03,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144474517] [2022-11-21 16:10:03,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:03,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:10:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:10:04,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:10:04,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144474517] [2022-11-21 16:10:04,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144474517] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:10:04,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:10:04,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:10:04,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720649789] [2022-11-21 16:10:04,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:10:04,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:10:04,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:10:04,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:10:04,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:10:04,129 INFO L87 Difference]: Start difference. First operand 209 states and 429 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:10:04,267 INFO L93 Difference]: Finished difference Result 317 states and 631 transitions. [2022-11-21 16:10:04,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:10:04,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-21 16:10:04,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:10:04,269 INFO L225 Difference]: With dead ends: 317 [2022-11-21 16:10:04,269 INFO L226 Difference]: Without dead ends: 275 [2022-11-21 16:10:04,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:10:04,270 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:10:04,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 16 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:10:04,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-21 16:10:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 211. [2022-11-21 16:10:04,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 209 states have (on average 2.0669856459330145) internal successors, (432), 210 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 432 transitions. [2022-11-21 16:10:04,276 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 432 transitions. Word has length 21 [2022-11-21 16:10:04,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:10:04,277 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 432 transitions. [2022-11-21 16:10:04,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:10:04,277 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 432 transitions. [2022-11-21 16:10:04,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:10:04,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:10:04,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:04,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 16:10:04,278 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:10:04,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:10:04,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2034226655, now seen corresponding path program 3 times [2022-11-21 16:10:04,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:10:04,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994582035] [2022-11-21 16:10:04,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:10:04,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:10:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:10:04,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:10:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:10:04,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:10:04,528 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:10:04,529 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2022-11-21 16:10:04,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2022-11-21 16:10:04,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2022-11-21 16:10:04,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2022-11-21 16:10:04,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2022-11-21 16:10:04,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2022-11-21 16:10:04,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2022-11-21 16:10:04,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2022-11-21 16:10:04,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2022-11-21 16:10:04,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2022-11-21 16:10:04,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2022-11-21 16:10:04,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2022-11-21 16:10:04,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2022-11-21 16:10:04,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2022-11-21 16:10:04,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2022-11-21 16:10:04,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2022-11-21 16:10:04,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2022-11-21 16:10:04,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2022-11-21 16:10:04,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2022-11-21 16:10:04,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2022-11-21 16:10:04,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2022-11-21 16:10:04,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2022-11-21 16:10:04,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2022-11-21 16:10:04,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2022-11-21 16:10:04,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2022-11-21 16:10:04,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2022-11-21 16:10:04,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2022-11-21 16:10:04,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2022-11-21 16:10:04,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2022-11-21 16:10:04,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2022-11-21 16:10:04,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2022-11-21 16:10:04,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2022-11-21 16:10:04,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2022-11-21 16:10:04,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2022-11-21 16:10:04,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2022-11-21 16:10:04,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (25 of 61 remaining) [2022-11-21 16:10:04,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2022-11-21 16:10:04,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2022-11-21 16:10:04,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2022-11-21 16:10:04,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2022-11-21 16:10:04,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2022-11-21 16:10:04,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2022-11-21 16:10:04,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2022-11-21 16:10:04,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2022-11-21 16:10:04,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2022-11-21 16:10:04,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2022-11-21 16:10:04,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2022-11-21 16:10:04,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2022-11-21 16:10:04,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2022-11-21 16:10:04,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2022-11-21 16:10:04,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2022-11-21 16:10:04,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2022-11-21 16:10:04,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2022-11-21 16:10:04,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2022-11-21 16:10:04,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2022-11-21 16:10:04,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2022-11-21 16:10:04,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2022-11-21 16:10:04,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2022-11-21 16:10:04,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2022-11-21 16:10:04,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2022-11-21 16:10:04,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2022-11-21 16:10:04,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 16:10:04,550 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:10:04,557 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 16:10:04,557 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:10:04,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:10:04 BasicIcfg [2022-11-21 16:10:04,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:10:04,686 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:10:04,686 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:10:04,687 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:10:04,687 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:09:23" (3/4) ... [2022-11-21 16:10:04,690 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 16:10:04,691 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:10:04,691 INFO L158 Benchmark]: Toolchain (without parser) took 43905.40ms. Allocated memory was 127.9MB in the beginning and 453.0MB in the end (delta: 325.1MB). Free memory was 89.2MB in the beginning and 351.7MB in the end (delta: -262.5MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. [2022-11-21 16:10:04,692 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 127.9MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:10:04,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 921.54ms. Allocated memory is still 127.9MB. Free memory was 88.9MB in the beginning and 65.6MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-21 16:10:04,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.13ms. Allocated memory is still 127.9MB. Free memory was 65.6MB in the beginning and 63.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:10:04,693 INFO L158 Benchmark]: Boogie Preprocessor took 80.25ms. Allocated memory is still 127.9MB. Free memory was 63.1MB in the beginning and 61.0MB in the end (delta: 2.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-21 16:10:04,693 INFO L158 Benchmark]: RCFGBuilder took 1630.54ms. Allocated memory was 127.9MB in the beginning and 174.1MB in the end (delta: 46.1MB). Free memory was 60.7MB in the beginning and 112.0MB in the end (delta: -51.3MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2022-11-21 16:10:04,694 INFO L158 Benchmark]: TraceAbstraction took 41159.23ms. Allocated memory was 174.1MB in the beginning and 453.0MB in the end (delta: 278.9MB). Free memory was 110.9MB in the beginning and 352.8MB in the end (delta: -241.8MB). Peak memory consumption was 283.6MB. Max. memory is 16.1GB. [2022-11-21 16:10:04,694 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 453.0MB. Free memory was 352.8MB in the beginning and 351.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:10:04,696 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.38ms. Allocated memory is still 127.9MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 921.54ms. Allocated memory is still 127.9MB. Free memory was 88.9MB in the beginning and 65.6MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.13ms. Allocated memory is still 127.9MB. Free memory was 65.6MB in the beginning and 63.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 80.25ms. Allocated memory is still 127.9MB. Free memory was 63.1MB in the beginning and 61.0MB in the end (delta: 2.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1630.54ms. Allocated memory was 127.9MB in the beginning and 174.1MB in the end (delta: 46.1MB). Free memory was 60.7MB in the beginning and 112.0MB in the end (delta: -51.3MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * TraceAbstraction took 41159.23ms. Allocated memory was 174.1MB in the beginning and 453.0MB in the end (delta: 278.9MB). Free memory was 110.9MB in the beginning and 352.8MB in the end (delta: -241.8MB). Peak memory consumption was 283.6MB. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 453.0MB. Free memory was 352.8MB in the beginning and 351.7MB 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: 24.5s, 177 PlacesBefore, 73 PlacesAfterwards, 169 TransitionsBefore, 64 TransitionsAfterwards, 5336 CoEnabledTransitionPairs, 8 FixpointIterations, 71 TrivialSequentialCompositions, 93 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 171 TotalNumberOfCompositions, 18429 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8264, independent: 7904, independent conditional: 0, independent unconditional: 7904, dependent: 290, dependent conditional: 0, dependent unconditional: 290, unknown: 70, unknown conditional: 0, unknown unconditional: 70] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3463, independent: 3377, independent conditional: 0, independent unconditional: 3377, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3463, independent: 3106, independent conditional: 0, independent unconditional: 3106, dependent: 357, dependent conditional: 0, dependent unconditional: 357, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 357, independent: 271, independent conditional: 0, independent unconditional: 271, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2118, independent: 1179, independent conditional: 0, independent unconditional: 1179, dependent: 625, dependent conditional: 0, dependent unconditional: 625, unknown: 314, unknown conditional: 0, unknown unconditional: 314] ], Cache Queries: [ total: 8264, independent: 4527, independent conditional: 0, independent unconditional: 4527, dependent: 216, dependent conditional: 0, dependent unconditional: 216, unknown: 3521, unknown conditional: 0, unknown unconditional: 3521] , Statistics on independence cache: Total cache size (in pairs): 551, Positive cache size: 523, Positive conditional cache size: 0, Positive unconditional cache size: 523, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 6, Unknown conditional cache size: 0, Unknown unconditional cache size: 6 - 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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L835] 0 pthread_t t2097; [L836] FCALL, FORK 0 pthread_create(&t2097, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2097, ((void *)0), P0, ((void *)0))=-2, t2097={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 pthread_t t2098; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2097={7:0}, t2098={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] FCALL, FORK 0 pthread_create(&t2098, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2098, ((void *)0), P1, ((void *)0))=-1, t2097={7:0}, t2098={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L839] 0 pthread_t t2099; [L840] FCALL, FORK 0 pthread_create(&t2099, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2099, ((void *)0), P2, ((void *)0))=0, t2097={7:0}, t2098={5:0}, t2099={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 \read(y) [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=255, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=255, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L792] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=0, weak$$choice1=255, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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=0, weak$$choice1=255, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L810] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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=0, weak$$choice1=255, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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=0, weak$$choice1=255, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 \read(y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2097={7:0}, t2098={5:0}, t2099={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L854] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L854] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L854] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L854] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L857] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 833]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 836]: 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: 840]: 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, 215 locations, 61 error locations. Started 1 CEGAR loops. OverallTime: 40.8s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 25.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 742 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 742 mSDsluCounter, 300 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 184 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1924 IncrementalHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 116 mSDtfsCounter, 1924 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13680occurred in iteration=0, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 2850 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 2672 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-21 16:10:04,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/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_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/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_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/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_9c7fa509-58e9-4a34-813e-b42de524a3d0/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 7ff9a02e3a4860dd4559a47ff1369af4fea93a232a0eb144fdecc9bc5971fe5b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:10:07,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:10:07,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:10:07,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:10:07,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:10:07,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:10:07,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:10:07,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:10:07,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:10:07,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:10:07,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:10:07,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:10:07,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:10:07,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:10:07,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:10:07,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:10:07,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:10:07,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:10:07,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:10:07,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:10:07,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:10:07,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:10:07,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:10:07,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:10:07,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:10:07,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:10:07,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:10:07,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:10:07,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:10:07,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:10:07,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:10:07,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:10:07,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:10:07,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:10:07,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:10:07,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:10:07,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:10:07,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:10:07,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:10:07,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:10:07,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:10:07,353 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-21 16:10:07,403 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:10:07,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:10:07,405 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:10:07,406 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:10:07,407 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:10:07,407 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:10:07,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:10:07,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:10:07,408 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:10:07,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:10:07,410 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:10:07,410 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:10:07,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:10:07,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:10:07,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:10:07,411 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 16:10:07,411 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 16:10:07,412 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 16:10:07,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:10:07,412 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:10:07,412 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-21 16:10:07,412 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-21 16:10:07,413 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:10:07,413 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:10:07,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:10:07,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:10:07,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:10:07,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:10:07,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:10:07,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:10:07,415 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-21 16:10:07,415 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-21 16:10:07,415 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-21 16:10:07,416 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_9c7fa509-58e9-4a34-813e-b42de524a3d0/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_9c7fa509-58e9-4a34-813e-b42de524a3d0/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 -> 7ff9a02e3a4860dd4559a47ff1369af4fea93a232a0eb144fdecc9bc5971fe5b [2022-11-21 16:10:07,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:10:07,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:10:07,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:10:07,906 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:10:07,906 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:10:07,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i [2022-11-21 16:10:11,230 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:10:11,519 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:10:11,520 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i [2022-11-21 16:10:11,546 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/data/673a82fac/ddb0fbae3f2b48e7a88dab4239878af2/FLAG8db1dfbe4 [2022-11-21 16:10:11,560 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/data/673a82fac/ddb0fbae3f2b48e7a88dab4239878af2 [2022-11-21 16:10:11,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:10:11,564 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:10:11,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:10:11,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:10:11,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:10:11,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:10:11" (1/1) ... [2022-11-21 16:10:11,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d7c041e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:11, skipping insertion in model container [2022-11-21 16:10:11,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:10:11" (1/1) ... [2022-11-21 16:10:11,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:10:11,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:10:11,845 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_9c7fa509-58e9-4a34-813e-b42de524a3d0/sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i[995,1008] [2022-11-21 16:10:12,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:10:12,128 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:10:12,141 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_9c7fa509-58e9-4a34-813e-b42de524a3d0/sv-benchmarks/c/pthread-wmm/safe014_power.oepc.i[995,1008] [2022-11-21 16:10:12,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:10:12,220 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:10:12,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:12 WrapperNode [2022-11-21 16:10:12,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:10:12,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:10:12,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:10:12,222 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:10:12,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:12" (1/1) ... [2022-11-21 16:10:12,248 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:12" (1/1) ... [2022-11-21 16:10:12,272 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-11-21 16:10:12,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:10:12,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:10:12,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:10:12,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:10:12,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:12" (1/1) ... [2022-11-21 16:10:12,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:12" (1/1) ... [2022-11-21 16:10:12,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:12" (1/1) ... [2022-11-21 16:10:12,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:12" (1/1) ... [2022-11-21 16:10:12,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:12" (1/1) ... [2022-11-21 16:10:12,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:12" (1/1) ... [2022-11-21 16:10:12,306 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:12" (1/1) ... [2022-11-21 16:10:12,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:12" (1/1) ... [2022-11-21 16:10:12,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:10:12,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:10:12,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:10:12,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:10:12,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:12" (1/1) ... [2022-11-21 16:10:12,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:10:12,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:10:12,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:10:12,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:10:12,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-21 16:10:12,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:10:12,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:10:12,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:10:12,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:10:12,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-21 16:10:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-21 16:10:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-21 16:10:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-21 16:10:12,483 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-21 16:10:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-21 16:10:12,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-21 16:10:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-21 16:10:12,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-21 16:10:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:10:12,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:10:12,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:10:12,487 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:10:12,762 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:10:12,764 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:10:13,416 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:10:14,158 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:10:14,159 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 16:10:14,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:10:14 BoogieIcfgContainer [2022-11-21 16:10:14,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:10:14,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:10:14,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:10:14,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:10:14,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:10:11" (1/3) ... [2022-11-21 16:10:14,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1d30f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:10:14, skipping insertion in model container [2022-11-21 16:10:14,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:10:12" (2/3) ... [2022-11-21 16:10:14,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1d30f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:10:14, skipping insertion in model container [2022-11-21 16:10:14,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:10:14" (3/3) ... [2022-11-21 16:10:14,175 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_power.oepc.i [2022-11-21 16:10:14,197 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:10:14,198 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2022-11-21 16:10:14,198 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:10:14,372 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 16:10:14,426 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 16:10:14,456 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 170 transitions, 355 flow [2022-11-21 16:10:14,463 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 170 transitions, 355 flow [2022-11-21 16:10:14,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 170 transitions, 355 flow [2022-11-21 16:10:14,648 INFO L130 PetriNetUnfolder]: 2/167 cut-off events. [2022-11-21 16:10:14,648 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:10:14,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 167 events. 2/167 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 215 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2022-11-21 16:10:14,662 INFO L119 LiptonReduction]: Number of co-enabled transitions 5336 [2022-11-21 16:10:27,842 WARN L233 SmtUtils]: Spent 5.33s on a formula simplification. DAG size of input: 195 DAG size of output: 193 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-21 16:10:32,949 WARN L233 SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 193 DAG size of output: 193 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-21 16:10:39,390 WARN L233 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 223 DAG size of output: 222 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-21 16:11:05,997 INFO L134 LiptonReduction]: Checked pairs total: 16649 [2022-11-21 16:11:05,997 INFO L136 LiptonReduction]: Total number of compositions: 170 [2022-11-21 16:11:06,006 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 64 transitions, 143 flow [2022-11-21 16:11:06,719 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 13680 states, 12540 states have (on average 3.893859649122807) internal successors, (48829), 13679 states have internal predecessors, (48829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:06,744 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:11:06,753 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;@eca7587, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:11:06,753 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2022-11-21 16:11:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 13680 states, 12540 states have (on average 3.893859649122807) internal successors, (48829), 13679 states have internal predecessors, (48829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:06,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 16:11:06,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:06,797 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 16:11:06,799 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:11:06,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:06,810 INFO L85 PathProgramCache]: Analyzing trace with hash 952, now seen corresponding path program 1 times [2022-11-21 16:11:06,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:11:06,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874696540] [2022-11-21 16:11:06,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:06,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:06,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:11:06,836 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:11:06,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-21 16:11:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:07,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-21 16:11:07,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:11:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:11:07,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:11:07,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:11:07,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874696540] [2022-11-21 16:11:07,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874696540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:11:07,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:11:07,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 16:11:07,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872893214] [2022-11-21 16:11:07,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:11:07,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:11:07,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:11:07,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:11:07,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:11:07,131 INFO L87 Difference]: Start difference. First operand has 13680 states, 12540 states have (on average 3.893859649122807) internal successors, (48829), 13679 states have internal predecessors, (48829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:07,529 INFO L93 Difference]: Finished difference Result 3308 states and 11165 transitions. [2022-11-21 16:11:07,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:11:07,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-21 16:11:07,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:07,589 INFO L225 Difference]: With dead ends: 3308 [2022-11-21 16:11:07,590 INFO L226 Difference]: Without dead ends: 3308 [2022-11-21 16:11:07,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:11:07,597 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:11:07,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:11:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2022-11-21 16:11:07,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 3308. [2022-11-21 16:11:07,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3308 states, 3174 states have (on average 3.517643352236925) internal successors, (11165), 3307 states have internal predecessors, (11165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 11165 transitions. [2022-11-21 16:11:07,898 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 11165 transitions. Word has length 1 [2022-11-21 16:11:07,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:07,899 INFO L495 AbstractCegarLoop]: Abstraction has 3308 states and 11165 transitions. [2022-11-21 16:11:07,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 11165 transitions. [2022-11-21 16:11:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 16:11:07,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:07,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 16:11:07,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/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 16:11:08,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:08,108 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:11:08,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:08,109 INFO L85 PathProgramCache]: Analyzing trace with hash 937915, now seen corresponding path program 1 times [2022-11-21 16:11:08,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:11:08,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392466301] [2022-11-21 16:11:08,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:08,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:08,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:11:08,112 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:11:08,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-21 16:11:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:08,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:11:08,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:11:08,531 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 16:11:08,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-21 16:11:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:11:08,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:11:08,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:11:08,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392466301] [2022-11-21 16:11:08,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392466301] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:11:08,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:11:08,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:11:08,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123768915] [2022-11-21 16:11:08,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:11:08,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:11:08,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:11:08,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:11:08,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:11:08,581 INFO L87 Difference]: Start difference. First operand 3308 states and 11165 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:08,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:08,891 INFO L93 Difference]: Finished difference Result 1997 states and 6530 transitions. [2022-11-21 16:11:08,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:11:08,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-21 16:11:08,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:08,915 INFO L225 Difference]: With dead ends: 1997 [2022-11-21 16:11:08,915 INFO L226 Difference]: Without dead ends: 1997 [2022-11-21 16:11:08,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:11:08,924 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 24 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:11:08,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 6 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:11:08,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2022-11-21 16:11:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1997. [2022-11-21 16:11:09,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1948 states have (on average 3.3521560574948666) internal successors, (6530), 1996 states have internal predecessors, (6530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:09,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 6530 transitions. [2022-11-21 16:11:09,156 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 6530 transitions. Word has length 3 [2022-11-21 16:11:09,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:09,157 INFO L495 AbstractCegarLoop]: Abstraction has 1997 states and 6530 transitions. [2022-11-21 16:11:09,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 6530 transitions. [2022-11-21 16:11:09,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 16:11:09,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:09,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 16:11:09,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:11:09,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:09,368 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:11:09,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:09,369 INFO L85 PathProgramCache]: Analyzing trace with hash 937916, now seen corresponding path program 1 times [2022-11-21 16:11:09,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:11:09,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559258055] [2022-11-21 16:11:09,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:09,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:09,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:11:09,372 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:11:09,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-21 16:11:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:09,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:11:09,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:11:09,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:11:09,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 16:11:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:11:09,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:11:09,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:11:09,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559258055] [2022-11-21 16:11:09,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559258055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:11:09,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:11:09,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:11:09,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864394099] [2022-11-21 16:11:09,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:11:09,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:11:09,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:11:09,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:11:09,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:11:09,663 INFO L87 Difference]: Start difference. First operand 1997 states and 6530 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:09,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:09,834 INFO L93 Difference]: Finished difference Result 1238 states and 3933 transitions. [2022-11-21 16:11:09,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:11:09,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-21 16:11:09,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:09,845 INFO L225 Difference]: With dead ends: 1238 [2022-11-21 16:11:09,845 INFO L226 Difference]: Without dead ends: 1238 [2022-11-21 16:11:09,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:11:09,847 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:11:09,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:11:09,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2022-11-21 16:11:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1238. [2022-11-21 16:11:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1220 states have (on average 3.2237704918032786) internal successors, (3933), 1237 states have internal predecessors, (3933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:09,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 3933 transitions. [2022-11-21 16:11:09,914 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 3933 transitions. Word has length 3 [2022-11-21 16:11:09,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:09,914 INFO L495 AbstractCegarLoop]: Abstraction has 1238 states and 3933 transitions. [2022-11-21 16:11:09,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:09,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 3933 transitions. [2022-11-21 16:11:09,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 16:11:09,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:09,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:11:09,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:11:10,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:10,132 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:11:10,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:10,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2128663666, now seen corresponding path program 1 times [2022-11-21 16:11:10,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:11:10,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24718017] [2022-11-21 16:11:10,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:10,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:10,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:11:10,135 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:11:10,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-21 16:11:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:10,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:11:10,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:11:10,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:11:10,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:11:10,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:11:10,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24718017] [2022-11-21 16:11:10,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24718017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:11:10,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:11:10,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:11:10,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956541420] [2022-11-21 16:11:10,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:11:10,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:11:10,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:11:10,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:11:10,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:11:10,424 INFO L87 Difference]: Start difference. First operand 1238 states and 3933 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:10,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:10,615 INFO L93 Difference]: Finished difference Result 692 states and 1806 transitions. [2022-11-21 16:11:10,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:11:10,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 16:11:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:10,620 INFO L225 Difference]: With dead ends: 692 [2022-11-21 16:11:10,620 INFO L226 Difference]: Without dead ends: 692 [2022-11-21 16:11:10,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:11:10,621 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:11:10,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 10 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:11:10,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-11-21 16:11:10,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2022-11-21 16:11:10,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 674 states have (on average 2.679525222551929) internal successors, (1806), 691 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:10,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1806 transitions. [2022-11-21 16:11:10,647 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1806 transitions. Word has length 10 [2022-11-21 16:11:10,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:10,647 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 1806 transitions. [2022-11-21 16:11:10,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1806 transitions. [2022-11-21 16:11:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 16:11:10,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:10,650 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:11:10,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:11:10,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:10,863 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:11:10,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:10,864 INFO L85 PathProgramCache]: Analyzing trace with hash -138974536, now seen corresponding path program 1 times [2022-11-21 16:11:10,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:11:10,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802552077] [2022-11-21 16:11:10,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:10,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:10,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:11:10,866 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:11:10,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-21 16:11:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:11,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:11:11,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:11:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:11:11,278 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:11:11,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:11:11,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802552077] [2022-11-21 16:11:11,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802552077] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:11:11,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:11:11,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:11:11,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302608166] [2022-11-21 16:11:11,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:11:11,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:11:11,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:11:11,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:11:11,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:11:11,281 INFO L87 Difference]: Start difference. First operand 692 states and 1806 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 16:11:11,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:11,632 INFO L93 Difference]: Finished difference Result 261 states and 550 transitions. [2022-11-21 16:11:11,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:11:11,633 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 16:11:11,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:11,634 INFO L225 Difference]: With dead ends: 261 [2022-11-21 16:11:11,635 INFO L226 Difference]: Without dead ends: 261 [2022-11-21 16:11:11,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:11:11,636 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:11:11,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 18 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:11:11,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-21 16:11:11,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2022-11-21 16:11:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 249 states have (on average 2.208835341365462) internal successors, (550), 260 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:11,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 550 transitions. [2022-11-21 16:11:11,647 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 550 transitions. Word has length 13 [2022-11-21 16:11:11,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:11,647 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 550 transitions. [2022-11-21 16:11:11,648 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 16:11:11,648 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 550 transitions. [2022-11-21 16:11:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 16:11:11,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:11,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:11:11,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:11:11,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:11,871 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:11:11,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:11,872 INFO L85 PathProgramCache]: Analyzing trace with hash 68145999, now seen corresponding path program 1 times [2022-11-21 16:11:11,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:11:11,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006470422] [2022-11-21 16:11:11,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:11,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:11,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:11:11,873 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:11:11,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-21 16:11:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:12,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 16:11:12,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:11:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:11:12,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:11:12,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:11:12,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006470422] [2022-11-21 16:11:12,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006470422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:11:12,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:11:12,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:11:12,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207717568] [2022-11-21 16:11:12,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:11:12,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:11:12,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:11:12,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:11:12,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:11:12,227 INFO L87 Difference]: Start difference. First operand 261 states and 550 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 16:11:12,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:12,595 INFO L93 Difference]: Finished difference Result 151 states and 336 transitions. [2022-11-21 16:11:12,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:11:12,596 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 16:11:12,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:12,597 INFO L225 Difference]: With dead ends: 151 [2022-11-21 16:11:12,597 INFO L226 Difference]: Without dead ends: 151 [2022-11-21 16:11:12,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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 16:11:12,598 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 26 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:11:12,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 31 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:11:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-21 16:11:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-21 16:11:12,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 2.2857142857142856) internal successors, (336), 150 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 336 transitions. [2022-11-21 16:11:12,606 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 336 transitions. Word has length 16 [2022-11-21 16:11:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:12,607 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 336 transitions. [2022-11-21 16:11:12,607 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 16:11:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 336 transitions. [2022-11-21 16:11:12,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 16:11:12,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:12,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:11:12,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-21 16:11:12,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:12,823 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:11:12,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:12,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1190903038, now seen corresponding path program 1 times [2022-11-21 16:11:12,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:11:12,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67350124] [2022-11-21 16:11:12,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:12,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:12,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:11:12,826 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:11:12,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-21 16:11:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:13,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:11:13,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:11:19,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1845 treesize of output 1841 [2022-11-21 16:11:19,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1841 treesize of output 1833 [2022-11-21 16:11:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:11:19,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:11:19,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:11:19,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67350124] [2022-11-21 16:11:19,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67350124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:11:19,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:11:19,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:11:19,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179070314] [2022-11-21 16:11:19,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:11:19,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:11:19,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:11:19,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:11:19,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:11:19,324 INFO L87 Difference]: Start difference. First operand 151 states and 336 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:19,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:19,535 INFO L93 Difference]: Finished difference Result 150 states and 335 transitions. [2022-11-21 16:11:19,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:11:19,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-21 16:11:19,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:19,537 INFO L225 Difference]: With dead ends: 150 [2022-11-21 16:11:19,538 INFO L226 Difference]: Without dead ends: 150 [2022-11-21 16:11:19,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:11:19,539 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:11:19,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 5 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:11:19,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-21 16:11:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-21 16:11:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 147 states have (on average 2.2789115646258504) internal successors, (335), 149 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 16:11:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 335 transitions. [2022-11-21 16:11:19,544 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 335 transitions. Word has length 20 [2022-11-21 16:11:19,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:19,545 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 335 transitions. [2022-11-21 16:11:19,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:19,545 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 335 transitions. [2022-11-21 16:11:19,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 16:11:19,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:19,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:11:19,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-21 16:11:19,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:19,760 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:11:19,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:19,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1190903039, now seen corresponding path program 1 times [2022-11-21 16:11:19,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:11:19,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841526019] [2022-11-21 16:11:19,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:19,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:19,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:11:19,762 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:11:19,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-21 16:11:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:20,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-21 16:11:20,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:11:20,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 16:11:20,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-21 16:11:31,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:11:31,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:11:31,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:11:31,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841526019] [2022-11-21 16:11:31,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841526019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:11:31,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:11:31,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:11:31,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088051080] [2022-11-21 16:11:31,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:11:31,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:11:31,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:11:31,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:11:31,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:11:31,530 INFO L87 Difference]: Start difference. First operand 150 states and 335 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:31,735 INFO L93 Difference]: Finished difference Result 149 states and 334 transitions. [2022-11-21 16:11:31,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:11:31,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-21 16:11:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:31,736 INFO L225 Difference]: With dead ends: 149 [2022-11-21 16:11:31,737 INFO L226 Difference]: Without dead ends: 149 [2022-11-21 16:11:31,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:11:31,737 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 44 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:11:31,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 5 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:11:31,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-21 16:11:31,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-11-21 16:11:31,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 147 states have (on average 2.272108843537415) internal successors, (334), 148 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 334 transitions. [2022-11-21 16:11:31,742 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 334 transitions. Word has length 20 [2022-11-21 16:11:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:31,743 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 334 transitions. [2022-11-21 16:11:31,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 334 transitions. [2022-11-21 16:11:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:11:31,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:31,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:11:31,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-21 16:11:31,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:31,944 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:11:31,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:31,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1736714754, now seen corresponding path program 1 times [2022-11-21 16:11:31,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:11:31,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048456633] [2022-11-21 16:11:31,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:31,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:31,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:11:31,947 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:11:31,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-21 16:11:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:32,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:11:32,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:11:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:11:32,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:11:32,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:11:32,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048456633] [2022-11-21 16:11:32,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048456633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:11:32,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:11:32,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:11:32,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726985213] [2022-11-21 16:11:32,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:11:32,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:11:32,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:11:32,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:11:32,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:11:32,342 INFO L87 Difference]: Start difference. First operand 149 states and 334 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:32,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:32,583 INFO L93 Difference]: Finished difference Result 187 states and 400 transitions. [2022-11-21 16:11:32,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:11:32,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-21 16:11:32,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:32,585 INFO L225 Difference]: With dead ends: 187 [2022-11-21 16:11:32,585 INFO L226 Difference]: Without dead ends: 187 [2022-11-21 16:11:32,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:11:32,586 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:11:32,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 9 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:11:32,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-11-21 16:11:32,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2022-11-21 16:11:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 181 states have (on average 2.1933701657458564) internal successors, (397), 182 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 397 transitions. [2022-11-21 16:11:32,596 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 397 transitions. Word has length 21 [2022-11-21 16:11:32,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:32,597 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 397 transitions. [2022-11-21 16:11:32,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 397 transitions. [2022-11-21 16:11:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:11:32,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:32,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:11:32,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-21 16:11:32,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:32,813 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:11:32,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:32,813 INFO L85 PathProgramCache]: Analyzing trace with hash 400137770, now seen corresponding path program 2 times [2022-11-21 16:11:32,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:11:32,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109197269] [2022-11-21 16:11:32,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:11:32,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:32,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:11:32,815 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:11:32,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/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 (11)] Waiting until timeout for monitored process [2022-11-21 16:11:33,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 16:11:33,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:11:33,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:11:33,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:11:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:11:33,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:11:33,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:11:33,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109197269] [2022-11-21 16:11:33,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2109197269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:11:33,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:11:33,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:11:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015989791] [2022-11-21 16:11:33,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:11:33,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:11:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:11:33,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:11:33,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:11:33,116 INFO L87 Difference]: Start difference. First operand 183 states and 397 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:33,378 INFO L93 Difference]: Finished difference Result 255 states and 538 transitions. [2022-11-21 16:11:33,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:11:33,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-21 16:11:33,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:33,380 INFO L225 Difference]: With dead ends: 255 [2022-11-21 16:11:33,380 INFO L226 Difference]: Without dead ends: 255 [2022-11-21 16:11:33,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:11:33,381 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:11:33,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 16 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:11:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-21 16:11:33,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 199. [2022-11-21 16:11:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 2.218274111675127) internal successors, (437), 198 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 437 transitions. [2022-11-21 16:11:33,388 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 437 transitions. Word has length 21 [2022-11-21 16:11:33,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:33,388 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 437 transitions. [2022-11-21 16:11:33,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 437 transitions. [2022-11-21 16:11:33,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:11:33,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:33,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:11:33,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/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 (11)] Forceful destruction successful, exit code 0 [2022-11-21 16:11:33,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:33,603 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:11:33,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:33,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2111889706, now seen corresponding path program 3 times [2022-11-21 16:11:33,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:11:33,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461407417] [2022-11-21 16:11:33,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:11:33,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:33,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:11:33,605 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:11:33,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/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 (12)] Waiting until timeout for monitored process [2022-11-21 16:11:33,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-21 16:11:33,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:11:33,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:11:33,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:11:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:11:33,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:11:33,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:11:33,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461407417] [2022-11-21 16:11:33,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461407417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:11:33,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:11:33,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:11:33,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118753647] [2022-11-21 16:11:33,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:11:33,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:11:33,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:11:33,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:11:33,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:11:33,892 INFO L87 Difference]: Start difference. First operand 199 states and 437 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:34,161 INFO L93 Difference]: Finished difference Result 279 states and 590 transitions. [2022-11-21 16:11:34,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:11:34,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-21 16:11:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:34,163 INFO L225 Difference]: With dead ends: 279 [2022-11-21 16:11:34,164 INFO L226 Difference]: Without dead ends: 279 [2022-11-21 16:11:34,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:11:34,164 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:11:34,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 16 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:11:34,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-21 16:11:34,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 199. [2022-11-21 16:11:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 2.2081218274111674) internal successors, (435), 198 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:34,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 435 transitions. [2022-11-21 16:11:34,172 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 435 transitions. Word has length 21 [2022-11-21 16:11:34,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:34,173 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 435 transitions. [2022-11-21 16:11:34,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:34,173 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 435 transitions. [2022-11-21 16:11:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:11:34,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:34,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:11:34,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/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 (12)] Forceful destruction successful, exit code 0 [2022-11-21 16:11:34,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:34,388 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:11:34,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:34,388 INFO L85 PathProgramCache]: Analyzing trace with hash -217418082, now seen corresponding path program 4 times [2022-11-21 16:11:34,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:11:34,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290724416] [2022-11-21 16:11:34,388 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 16:11:34,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:34,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:11:34,390 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:11:34,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/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 (13)] Waiting until timeout for monitored process [2022-11-21 16:11:34,621 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 16:11:34,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:11:34,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 16:11:34,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:11:34,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:11:34,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:11:34,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 16:11:34,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290724416] [2022-11-21 16:11:34,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290724416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:11:34,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:11:34,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:11:34,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523149903] [2022-11-21 16:11:34,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:11:34,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:11:34,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 16:11:34,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:11:34,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:11:34,695 INFO L87 Difference]: Start difference. First operand 199 states and 435 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:34,901 INFO L93 Difference]: Finished difference Result 271 states and 576 transitions. [2022-11-21 16:11:34,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:11:34,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-21 16:11:34,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:34,904 INFO L225 Difference]: With dead ends: 271 [2022-11-21 16:11:34,904 INFO L226 Difference]: Without dead ends: 271 [2022-11-21 16:11:34,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:11:34,905 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:11:34,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 12 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:11:34,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-11-21 16:11:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 191. [2022-11-21 16:11:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 189 states have (on average 2.2063492063492065) internal successors, (417), 190 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 417 transitions. [2022-11-21 16:11:34,912 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 417 transitions. Word has length 21 [2022-11-21 16:11:34,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:34,912 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 417 transitions. [2022-11-21 16:11:34,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:11:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 417 transitions. [2022-11-21 16:11:34,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:11:34,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:34,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:11:34,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/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 (13)] Forceful destruction successful, exit code 0 [2022-11-21 16:11:35,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:35,128 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-21 16:11:35,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:35,128 INFO L85 PathProgramCache]: Analyzing trace with hash -44207136, now seen corresponding path program 5 times [2022-11-21 16:11:35,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 16:11:35,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744623820] [2022-11-21 16:11:35,129 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 16:11:35,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:35,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 16:11:35,130 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-21 16:11:35,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/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 (14)] Waiting until timeout for monitored process [2022-11-21 16:11:35,450 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 16:11:35,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-21 16:11:35,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:11:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:11:35,669 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-21 16:11:35,669 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:11:35,670 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2022-11-21 16:11:35,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2022-11-21 16:11:35,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2022-11-21 16:11:35,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2022-11-21 16:11:35,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2022-11-21 16:11:35,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2022-11-21 16:11:35,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2022-11-21 16:11:35,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2022-11-21 16:11:35,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2022-11-21 16:11:35,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2022-11-21 16:11:35,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2022-11-21 16:11:35,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2022-11-21 16:11:35,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2022-11-21 16:11:35,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2022-11-21 16:11:35,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2022-11-21 16:11:35,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2022-11-21 16:11:35,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2022-11-21 16:11:35,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2022-11-21 16:11:35,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2022-11-21 16:11:35,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2022-11-21 16:11:35,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2022-11-21 16:11:35,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2022-11-21 16:11:35,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2022-11-21 16:11:35,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2022-11-21 16:11:35,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2022-11-21 16:11:35,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2022-11-21 16:11:35,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2022-11-21 16:11:35,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2022-11-21 16:11:35,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2022-11-21 16:11:35,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2022-11-21 16:11:35,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2022-11-21 16:11:35,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2022-11-21 16:11:35,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2022-11-21 16:11:35,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2022-11-21 16:11:35,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2022-11-21 16:11:35,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (25 of 61 remaining) [2022-11-21 16:11:35,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2022-11-21 16:11:35,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2022-11-21 16:11:35,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2022-11-21 16:11:35,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2022-11-21 16:11:35,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2022-11-21 16:11:35,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2022-11-21 16:11:35,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2022-11-21 16:11:35,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2022-11-21 16:11:35,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2022-11-21 16:11:35,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2022-11-21 16:11:35,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2022-11-21 16:11:35,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2022-11-21 16:11:35,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2022-11-21 16:11:35,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2022-11-21 16:11:35,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2022-11-21 16:11:35,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2022-11-21 16:11:35,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2022-11-21 16:11:35,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2022-11-21 16:11:35,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2022-11-21 16:11:35,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2022-11-21 16:11:35,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2022-11-21 16:11:35,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2022-11-21 16:11:35,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2022-11-21 16:11:35,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2022-11-21 16:11:35,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2022-11-21 16:11:35,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/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 (14)] Forceful destruction successful, exit code 0 [2022-11-21 16:11:35,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-21 16:11:35,900 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:11:35,906 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 16:11:35,907 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:11:36,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:11:36 BasicIcfg [2022-11-21 16:11:36,033 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:11:36,034 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:11:36,034 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:11:36,034 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:11:36,035 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:10:14" (3/4) ... [2022-11-21 16:11:36,038 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 16:11:36,038 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:11:36,039 INFO L158 Benchmark]: Toolchain (without parser) took 84475.01ms. Allocated memory was 77.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 35.3MB in the beginning and 598.7MB in the end (delta: -563.4MB). Peak memory consumption was 653.7MB. Max. memory is 16.1GB. [2022-11-21 16:11:36,039 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 77.6MB. Free memory is still 55.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:11:36,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 654.89ms. Allocated memory is still 77.6MB. Free memory was 35.1MB in the beginning and 38.2MB in the end (delta: -3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-21 16:11:36,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.50ms. Allocated memory is still 77.6MB. Free memory was 38.2MB in the beginning and 35.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 16:11:36,044 INFO L158 Benchmark]: Boogie Preprocessor took 53.13ms. Allocated memory is still 77.6MB. Free memory was 35.8MB in the beginning and 33.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:11:36,044 INFO L158 Benchmark]: RCFGBuilder took 1834.26ms. Allocated memory was 77.6MB in the beginning and 107.0MB in the end (delta: 29.4MB). Free memory was 33.1MB in the beginning and 45.9MB in the end (delta: -12.8MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2022-11-21 16:11:36,045 INFO L158 Benchmark]: TraceAbstraction took 81869.41ms. Allocated memory was 107.0MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 45.2MB in the beginning and 599.7MB in the end (delta: -554.6MB). Peak memory consumption was 632.8MB. Max. memory is 16.1GB. [2022-11-21 16:11:36,045 INFO L158 Benchmark]: Witness Printer took 4.27ms. Allocated memory is still 1.3GB. Free memory is still 598.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:11:36,049 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.37ms. Allocated memory is still 77.6MB. Free memory is still 55.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 654.89ms. Allocated memory is still 77.6MB. Free memory was 35.1MB in the beginning and 38.2MB in the end (delta: -3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.50ms. Allocated memory is still 77.6MB. Free memory was 38.2MB in the beginning and 35.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.13ms. Allocated memory is still 77.6MB. Free memory was 35.8MB in the beginning and 33.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1834.26ms. Allocated memory was 77.6MB in the beginning and 107.0MB in the end (delta: 29.4MB). Free memory was 33.1MB in the beginning and 45.9MB in the end (delta: -12.8MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 81869.41ms. Allocated memory was 107.0MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 45.2MB in the beginning and 599.7MB in the end (delta: -554.6MB). Peak memory consumption was 632.8MB. Max. memory is 16.1GB. * Witness Printer took 4.27ms. Allocated memory is still 1.3GB. Free memory is still 598.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 51.5s, 178 PlacesBefore, 73 PlacesAfterwards, 170 TransitionsBefore, 64 TransitionsAfterwards, 5336 CoEnabledTransitionPairs, 7 FixpointIterations, 72 TrivialSequentialCompositions, 91 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 170 TotalNumberOfCompositions, 16649 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7909, independent: 7601, independent conditional: 0, independent unconditional: 7601, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 103, unknown conditional: 0, unknown unconditional: 103] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3447, independent: 3361, independent conditional: 0, independent unconditional: 3361, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3447, independent: 3091, independent conditional: 0, independent unconditional: 3091, dependent: 356, dependent conditional: 0, dependent unconditional: 356, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 356, independent: 270, independent conditional: 0, independent unconditional: 270, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3000, independent: 1357, independent conditional: 0, independent unconditional: 1357, dependent: 844, dependent conditional: 0, dependent unconditional: 844, unknown: 800, unknown conditional: 0, unknown unconditional: 800] ], Cache Queries: [ total: 7909, independent: 4240, independent conditional: 0, independent unconditional: 4240, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 3533, unknown conditional: 0, unknown unconditional: 3533] , Statistics on independence cache: Total cache size (in pairs): 546, Positive cache size: 524, Positive conditional cache size: 0, Positive unconditional cache size: 524, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 12, Unknown conditional cache size: 0, Unknown unconditional cache size: 12 - 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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L835] 0 pthread_t t2097; [L836] FCALL, FORK 0 pthread_create(&t2097, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2097, ((void *)0), P0, ((void *)0))=-1, t2097={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 pthread_t t2098; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2097={15:0}, t2098={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] FCALL, FORK 0 pthread_create(&t2098, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2098, ((void *)0), P1, ((void *)0))=0, t2097={15:0}, t2098={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L839] 0 pthread_t t2099; [L840] FCALL, FORK 0 pthread_create(&t2099, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2099, ((void *)0), P2, ((void *)0))=1, t2097={15:0}, t2098={5:0}, t2099={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] EXPR 1 \read(y) [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L792] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=0, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=0, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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=0, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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=0, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, 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=0, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 \read(y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2097={15:0}, t2098={5:0}, t2099={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L854] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L854] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L854] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L854] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L857] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=128, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 833]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 836]: 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: 840]: 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, 216 locations, 61 error locations. Started 1 CEGAR loops. OverallTime: 81.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 52.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 259 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 853 IncrementalHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 68 mSDtfsCounter, 853 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13680occurred in iteration=0, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 220 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 685 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1706 ConjunctsInSsa, 70 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 16:11:36,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c7fa509-58e9-4a34-813e-b42de524a3d0/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